% % SEND + MORE = MONEY % solve satisfy; % % Voyageur de commerce % var int: distance = sum(d); solve :: int_search(d, max_regret, indomain_split, complete) minimize distance; % % Sac à dos % var int: gain = sum(i in 1..N)(profit[i] * x[i]); solve :: int_search(x, max_regret,indomain_split, complete) maximize gain;