A continuous variable representation of the traveling salesman problem
From MaRDI portal
Publication:4168793
DOI10.1007/BF01609019zbMath0386.90058MaRDI QIDQ4168793
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Cites Work
- Unnamed Item
- Technical Note—Vertex Generation and Cardinality Constrained Linear Programs
- An Algorithm for the Traveling Salesman Problem
- The Traveling Salesman Problem: A Survey
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms
- The traveling-salesman problem and minimum spanning trees: Part II
- Computational Experience with an M-Salesman Traveling Salesman Algorithm