Short Combinatorial Proof that the DFJ Polytope is contained in the MTZ Polytope for the Asymmetric Traveling Salesman Problem.
Mark VelednitskyPublished in: CoRR (2018)
Keyphrases
- lattice points
- subtour elimination
- stable set
- convex hull
- knapsack problem
- semidefinite
- traveling salesman problem
- directed graph
- branch and bound
- branch and bound algorithm
- geometric properties
- combinatorial optimization problems
- hamiltonian cycle
- facet defining inequalities
- database
- convex sets
- lower bound
- decision trees
- search engine
- artificial intelligence