Traveling salesperson problem: Separation of the subtour elimination constraints as a combinatorial optimization problem. TSP formulation using cutset constraints, strengthened cutset constraints, separation as an undirected min-cut problem. Comparing the strength of IP formulations by comparing the feasible sets of their linear relaxations as convex polyhedra.
notes-2020-11-20.pdfVideos and all other materials are copyright 2020
Matthias Köppe and shared as Open Educational Resources subject to the
Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) license.
