Pages that link to "Item:Q4153924"
From MaRDI portal
The following pages link to The adjacency relation on the traveling salesman polytope is NP-Complete (Q4153924):
Displayed 20 items.
- Geometry, complexity, and combinatorics of permutation polytopes (Q690026) (← links)
- On the polytope of non-additive measures (Q835202) (← links)
- On minimal Eulerian graphs (Q1162523) (← links)
- Adjacency of the 0-1 knapsack problem (Q1195107) (← links)
- Faces with large diameter on the symmetric traveling salesman polytope (Q1200768) (← links)
- Adjacency on the constrained assignment problem (Q1270787) (← links)
- The monotonic diameter of traveling salesman polytopes (Q1271383) (← links)
- Some graphic uses of an even number of odd nodes (Q1296145) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Adjacency of vertices of the complete pre-order polytope (Q1377754) (← links)
- Interchange graphs and the Hamiltonian cycle polytope (Q1382266) (← links)
- The skeleton of the symmetric Traveling Salesman Polytope (Q1801669) (← links)
- On \({\mathbb{K}}^{\Delta}\) (Q1821691) (← links)
- Adjacency on combinatorial polyhedra (Q1842660) (← links)
- A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups (Q2460490) (← links)
- On pedigree polytopes and Hamiltonian cycles (Q2497514) (← links)
- Adjacency on polymatroids (Q3335528) (← links)
- On the facets and diameter of the<b><i>k</i></b>-cycle polytope (Q3426327) (← links)
- On Pedigree Polytopes and Hamiltonian Cycles (Q3439015) (← links)
- Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration (Q3627687) (← links)