Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
From MaRDI portal
Publication:2089667
DOI10.1016/j.tcs.2022.09.026OpenAlexW4297498048MaRDI QIDQ2089667
Marcel Turkensteen, Gerold Jäger
Publication date: 24 October 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.026
sensitivity analysiscombinatorial optimizationbottleneck objectivelinear bottleneck assignment problembottleneck spanning tree problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On min-max \(r\)-gatherings
- On dual solutions of the linear assignment problem
- Stability criteria in vector combinatorial bottleneck problems in terms of binary relations
- Bottleneck flows in unit capacity networks
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Improving the Hungarian assignment algorithm
- An augmenting path method for solving linear bottleneck assignment problems
- The Min-Max Spanning Tree Problem and some extensions
- Algorithms for updating minimal spanning trees
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Extending single tolerances to set tolerances
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- Shortest paths algorithms: Theory and experimental evaluation
- Tolerance-based branch and bound algorithms for the ATSP
- An addendum on: ``Sensitivity analysis of the optimal assignment
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths
- Solution of a Min-Max Vehicle Routing Problem
- An optimal minimum spanning tree algorithm
- Assignment Problems
- Algorithms for two bottleneck optimization problems
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Algorithms and Computation
This page was built for publication: Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
