THE TSP AND THE SUM OF ITS MARGINAL VALUES

DOI10.1142/S0218195906002063MaRDI QIDQ5485789zbMATH OpenOpenAlexWikidataFDO

Authors Moshe Dror, Yusin Lee, James B. Orlin, Valentin Polishchuk

Publication date 4 September 2006

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195906002063

zbMATH Keywords

cost allocationmixed integer programmingtraveling salesperson problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• An approximation algorithm for the TSP
• Multi-criteria TSP: Min and Max combined
• Multi-criteria TSP: Min and Max combined
• A certain generalization of the maximum traveling salesman problem
• TSP with bounded metrics
• An improved approximation algorithm for the maximum TSP
• scientific article; zbMATH DE number 1855663
• scientific article; zbMATH DE number 4218178
• The traveling salesman problem with cumulative costs
• scientific article; zbMATH DE number 1187152

Cites work

• Graph theory with applications
• Hypohamiltonian and hypotraceable graphs
• The traveling salesman problem and its variations

Cited in

(2)

• A great deluge algorithm for solving minimum ratio TSP
• The traveling salesman problem: the spectral radius and the length of an optimal tour

This page was built for publication: THE TSP AND THE SUM OF ITS MARGINAL VALUES

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