Tolerance-based Algorithms for the Traveling Salesman Problem

DOI10.1142/9789812813220_0005zbMath1223.90051OpenAlexW2131253091MaRDI QIDQ3542361

Gerold Jäger, Gregory Gutin, Diptesh Ghosh, Boris I. Goldengorin

Publication date: 1 December 2008

Published in: Mathematical Programming and Game Theory for Decision Making (Search for Journal in Brave)

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

zbMATH Keywords

greedy algorithmstraveling salesman problemsarc tolerances

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics ⋮ The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems ⋮ Extending single tolerances to set tolerances ⋮ Global tolerances in the problems of combinatorial optimization with an additive objective function ⋮ A tolerance-based heuristic approach for the weighted independent set problem