Pages that link to "Item:Q4081007"
From MaRDI portal
The following pages link to The travelling salesman problem and a class of polyhedra of diameter two (Q4081007):
Displayed 19 items.
- Geometry, complexity, and combinatorics of permutation polytopes (Q690026) (← links)
- Permutation polytopes and indecomposable elements in permutation groups (Q855825) (← links)
- Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions (Q1062913) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- Discrete extremal problems (Q1152306) (← links)
- The monotonic diameter of the perfect matching and shortest path polytopes (Q1200757) (← links)
- The monotonic diameter of traveling salesman polytopes (Q1271383) (← 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)
- Ideal polytopes and face structures of some combinatorial optimization problems (Q1924055) (← links)
- A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups (Q2460490) (← links)
- On the symmetric travelling salesman problem I: Inequalities (Q3048580) (← links)
- Adjacency on polymatroids (Q3335528) (← links)
- On the facets and diameter of the<b><i>k</i></b>-cycle polytope (Q3426327) (← links)
- Adjacency on the Postman Polyhedron (Q3963041) (← links)
- Edge-Connectivity on the Assignment Polytope (Q3964322) (← links)
- Partial linear characterizations of the asymmetric travelling salesman polytope (Q4119036) (← links)
- Lineare Charakterisierungen von Travelling Salesman Problemen (Q4119037) (← links)
- The adjacency relation on the traveling salesman polytope is NP-Complete (Q4153924) (← links)