Pages that link to "Item:Q3048580"
From MaRDI portal
The following pages link to On the symmetric travelling salesman problem I: Inequalities (Q3048580):
Displayed 37 items.
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- A spectral approach to polyhedral dimension (Q750306) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
- The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
- A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- On minimal Eulerian graphs (Q1162523) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← 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)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- The skeleton of the symmetric Traveling Salesman Polytope (Q1801669) (← 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)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- The 2-edge-connected subgraph polyhedron (Q2576774) (← links)
- On the symmetric travelling salesman problem II: Lifting theorems and facets (Q3048581) (← links)
- The traveling salesman problem on a graph and some related integer polyhedra (Q3675933) (← links)
- A continuous linear optimization model for the exact solution of travelling-salesman-problems in connexion with expansion planning of ring networks (Q3743069) (← links)
- Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program (Q4305487) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)