Extending single tolerances to set tolerances
From MaRDI portal
Publication:1671336
DOI10.1016/j.dam.2018.03.053zbMath1404.90116OpenAlexW2884276863WikidataQ129561336 ScholiaQ129561336MaRDI QIDQ1671336
Gerold Jäger, Marcel Turkensteen
Publication date: 6 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://pure.au.dk/ws/files/166885572/Turkensteen_2018_Extending_single_tolerances_to_set_tolerances.pdf
Related Items
Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
Uses Software
Cites Work
- Unnamed Item
- A note on robustness tolerances for combinatorial optimization problems
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
- Efficiently solvable special cases of bottleneck travelling salesman problems
- Algorithms for updating minimal spanning trees
- Solving the \(k\)-best traveling salesman problem
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
- The stability of the approximate Boolean minimization of a linear form
- Advances in sensitivity analysis and parametric programming
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Lower tolerance-based branch and bound algorithms for the ATSP
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- Some concepts of stability analysis in combinatorial optimization
- Tolerance-based branch and bound algorithms for the ATSP
- An addendum on: ``Sensitivity analysis of the optimal assignment
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- Assignment Problems
- Tolerance-based Algorithms for the Traveling Salesman Problem
- A note on Arc tolerances in sparse shortest-path and network flow problems
- Arc tolerances in shortest path and network flow problems
- An Algorithm for the Three-Index Assignment Problem
- Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
- Some Basics on Tolerances
- 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
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Experimental and Efficient Algorithms
- Graph-Theoretic Concepts in Computer Science
- Sensitivity analysis for scheduling problems
