Solving the \(k\)-best traveling salesman problem
From MaRDI portal
Publication:1302605
DOI10.1016/S0305-0548(98)00070-7zbMath0940.90069OpenAlexW1988718763WikidataQ127976495 ScholiaQ127976495MaRDI QIDQ1302605
Gerard Sierksma, Jack A. A. van der Veen, Edo S. van der Poort, Marek Libura
Publication date: 25 July 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00070-7
Related Items
\(k\)-shortest routing of trains on shunting yards ⋮ Extending single tolerances to set tolerances ⋮ Extremal values of global tolerances in combinatorial optimization with an additive objective function ⋮ Seeking global edges for traveling salesman problem in multi-start search ⋮ A tolerance-based heuristic approach for the weighted independent set problem ⋮ Unnamed Item ⋮ Stability aspects of the traveling salesman problem based on \(k\)-best solutions ⋮ On the complexity of postoptimality analysis of \(0/1\) programs
Uses Software
