A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer

DOI10.1016/0377-2217(79)90145-0zbMath0396.90063OpenAlexW1988270848MaRDI QIDQ1253610

Jan Karel Lenstra, Alexander H. G. Rinnooy Kan

Publication date: 1979

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(79)90145-0

zbMATH Keywords

Traveling Salesman ProblemAdmissible Transformations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Boolean programming (90C09)

Related Items (5)

Graphs in which all Hamiltonian cycles have the same length ⋮ The constant objective value property for multidimensional assignment problems ⋮ The multiple-robot assembly plan problem ⋮ SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts ⋮ Three value TSP and linkages with the three value linear spanning 2-forests

Cites Work

• Unnamed Item
• A characterization of linear admissible transformations for the m- travelling salesmen problem
• An Algorithm for the Traveling Salesman Problem
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer