The travelling salesman problem and a class of polyhedra of diameter two

DOI10.1007/BF01585502zbMath0318.90042MaRDI QIDQ4081007

No author found.

Publication date: 1974

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

Related Items

Geometry, complexity, and combinatorics of permutation polytopes, Permutation polytopes and indecomposable elements in permutation groups, Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions, The Boolean quadratic polytope: Some characteristics, facets and relatives, Discrete extremal problems, The monotonic diameter of the perfect matching and shortest path polytopes, The monotonic diameter of traveling salesman polytopes, On the complexity of some basic problems in computational convexity. I. Containment problems, Adjacency of vertices of the complete pre-order polytope, Ideal polytopes and face structures of some combinatorial optimization problems, A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups, On the symmetric travelling salesman problem I: Inequalities, Adjacency on polymatroids, On the facets and diameter of thek-cycle polytope, Adjacency on the Postman Polyhedron, Edge-Connectivity on the Assignment Polytope, Partial linear characterizations of the asymmetric travelling salesman polytope, Lineare Charakterisierungen von Travelling Salesman Problemen, The adjacency relation on the traveling salesman polytope is NP-Complete

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Establishing the matching polytope
• Letter to the Editor—The Multidimensional Assignment Problem
• On the Tours of a Traveling Salesman
• The Traveling Salesman Problem: A Survey
• Bottleneck extrema
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Some properties of the assignment polytope
• A fundamental problem in linear inequalities with applications to the travelling salesman problem
• On the Set-Covering Problem