A continuous variable representation of the traveling salesman problem

DOI10.1007/BF01609019MaRDI QIDQ4168793zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• An Algorithm for the Traveling Salesman Problem
• Computational Experience with an M-Salesman Traveling Salesman Algorithm
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms
• Technical Note—Vertex Generation and Cardinality Constrained Linear Programs
• The Traveling Salesman Problem: A Survey
• The traveling-salesman problem and minimum spanning trees: Part II

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168793)