Sensitivity analysis for bottleneck assignment problems
From MaRDI portal
Publication:2673565
DOI10.1016/j.ejor.2022.02.037OpenAlexW4212780071MaRDI QIDQ2673565
Elad Michael, Tony A. Wood, Chris Manzie, Iman Shames
Publication date: 10 June 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.00803
Cites Work
- A multi-level bottleneck assignment approach to the bus drivers' rostering problem
- Assignment problems: a golden anniversary survey
- A robust optimization solution to bottleneck generalized assignment problem under uncertainty
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Improving the Hungarian assignment algorithm
- Lexicographic bottleneck problems
- Sensitivity analysis in linear programming: Just be careful!
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- Solution methods and computational investigations for the linear bottleneck assignment problem
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- Some concepts of stability analysis in combinatorial optimization
- Sensitivity analysis of the optimal assignment.
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
- An addendum on: ``Sensitivity analysis of the optimal assignment
- SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
- The Shifting Bottleneck Procedure for Job Shop Scheduling