Optimization, Tabu Search, Travelling Salesman.
constraints here: x1 + x2 + x6 ≤ 1 x1 ≤ x3 When we violate those constraints we penalize the cost of 50 for each unit of violation . So in the figure above we have 2 violations so the penalty is 100. and the total cost of that spanning tree is 116 :) We need to find a solution that gives a low cost