Pages that link to "Item:Q1924487"
From MaRDI portal
The following pages link to All 0-1 polytopes are traveling salesman polytopes (Q1924487):
Displaying 14 items.
- Facets of the balanced minimal evolution polytope (Q304049) (← links)
- A lexicographic semiorder polytope and probabilistic representations of choice (Q440019) (← links)
- Semidefinite approximations of conical hulls of measured sets (Q512256) (← links)
- Any finite group is the group of some binary, convex polytope (Q1704900) (← links)
- An analog of the Cook theorem for polytopes (Q1759309) (← links)
- A combinatorial study of partial order polytopes (Q1867280) (← links)
- \(k\)-neighborly faces of the Boolean quadric polytopes (Q2259296) (← links)
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation (Q2259297) (← links)
- On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
- How to recycle your facets (Q2506820) (← links)
- Equivalence classes of full-dimensional 0/1-polytopes with many vertices (Q2514226) (← links)
- What is known about unit cubes (Q4663501) (← links)
- Partial Permutation and Alternating Sign Matrix Polytopes (Q5058123) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)