A continuous variable representation of the traveling salesman problem

DOI10.1007/BF01609019zbMath0386.90058OpenAlexW2006851947MaRDI QIDQ4168793

Joseph A. Svestka

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1007/bf01609019

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

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

This page was built for publication: A continuous variable representation of the traveling salesman problem