Pages that link to "Item:Q1186944"
From MaRDI portal
The following pages link to A complete description of the traveling salesman polytope on 8 nodes (Q1186944):
Displaying 16 items.
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
- The inequicut cone (Q688255) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← 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)
- Complete linear descriptions of small asymmetric traveling salesman polytopes (Q1900146) (← links)
- On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
- A note on small linear-ordering polytopes (Q2368130) (← links)
- New facets of the STS polytope generated from known facets of the ATS polytope (Q2494809) (← links)
- Small Travelling Salesman Polytopes (Q3978615) (← links)
- Coxeter‐associahedra (Q4323662) (← links)
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES (Q4682163) (← links)