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

DOI10.1016/0377-2217(79)90143-7zbMath0406.90044OpenAlexW1977926991MaRDI QIDQ1257826

Xavier Berenguer

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)90143-7

zbMATH Keywords

Delivery ProblemLinear Admissible TransformationsMultiple Travelling Salesman Problem

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (13)

Linearizable special cases of the QAP ⋮ Graphs in which all Hamiltonian cycles have the same length ⋮ A survey on combinatorial optimization in dynamic environments ⋮ Probabilistic combinatorial optimization problems on graphs: A new domain in operational research ⋮ The bilinear assignment problem: complexity and polynomially solvable special cases ⋮ The constant objective value property for multidimensional assignment problems ⋮ The multiple-robot assembly plan problem ⋮ Combinatorial optimization with interaction costs: complexity and solvable cases ⋮ SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts ⋮ A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer ⋮ The graphical relaxation: A new framework for the symmetric traveling salesman polytope ⋮ Three value TSP and linkages with the three value linear spanning 2-forests ⋮ Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems

Cites Work

• An Algorithm for the Traveling Salesman Problem
• Unnamed Item

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