Something went wrong

An error occurred, please try again later.

Copy for customer care: session ID 0a518181-16c7-e7d7-51b1-c78599b66f87:5b26f556-ca18-90a5-272c-fb216123b4c4

2020-11-20: TSP formulations: strength, relaxations (MAT 168 Optimization)

From Matthias Koeppe November 20, 2020

91 plays 0 comments You unliked the media.

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.pdf

Videos 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.

Appears In: MAT 168 Optimization (Matthias Köppe; Fall 2020)

Related Media

2020-11-20: TSP formulations: strength, relaxations (MAT 168 Optimization)

Related Media