Pages that link to "Item:Q3030581"
From MaRDI portal
The following pages link to Clique Tree Inequalities and the Symmetric Travelling Salesman Problem (Q3030581):
Displayed 20 items.
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (Q1181903) (← links)
- On symmetric subtour problems (Q1202764) (← 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)
- 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)
- The general routing polyhedron: A unifying framework (Q1806888) (← links)
- Ordered colourings (Q1896351) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets (Q2367914) (← links)
- The 2-edge-connected subgraph polyhedron (Q2576774) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)