Pages that link to "Item:Q4016696"
From MaRDI portal
The following pages link to The Crown Inequalities for the Symmetric Traveling Salesman Polytope (Q4016696):
Displaying 14 items.
- A complete description of the traveling salesman polytope on 8 nodes (Q1186944) (← links)
- Clique tree inequalities define facets of the asymmetric traveling salesman polytope (Q1343150) (← links)
- The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) (← links)
- The domino inequalities: facets for the symmetric traveling salesman polytope (Q1424296) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
- Hamiltonian path and symmetric travelling salesman polytopes (Q1803617) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- Worst-case comparison of valid inequalities for the TSP (Q1908019) (← links)
- Handles and teeth in the symmetric traveling salesman polytope (Q3973408) (← links)
- The Binested Inequalities for the Symmetric Traveling Salesman Polytope (Q4027789) (← links)
- (Q4468826) (← links)
- Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)