Some Basics on Tolerances

DOI10.1007/11775096_19zbMath1137.90646OpenAlexW1521557497MaRDI QIDQ5434399

Paul Molitor, Gerold Jäger, Boris I. Goldengorin

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11775096_19

zbMATH Keywords

Sensitivity analysislower toleranceupper tolerance

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (6)

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 ⋮ Lower tolerance-based branch and bound algorithms for the ATSP ⋮ Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP ⋮ Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order

This page was built for publication: Some Basics on Tolerances