A fundamental problem in linear inequalities with applications to the travelling salesman problem
From MaRDI portal
Publication:5663633
DOI10.1007/BF01584550zbMath0249.90038MaRDI QIDQ5663633
Publication date: 1972
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Application of primitive sets to multi-criteria optimization problems, On the complexity of a special basis problem in LP, On selecting models for nonlinear time series, The travelling salesman problem and a class of polyhedra of diameter two, The adjacency relation on the traveling salesman polytope is NP-Complete
Cites Work
- Unnamed Item
- Unnamed Item
- Integer Programming: Methods, Uses, Computations
- An Approach to Zero-One Integer Programming
- A Note on Linear Programming and Integer Feasibility
- Computer Solutions to Minimum-Cover Problems
- On the Tours of a Traveling Salesman
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Adjacency on Convex Polyhedra
- On the Set-Covering Problem