Sensitivity analysis for bottleneck assignment problems

DOI10.1016/J.EJOR.2022.02.037MaRDI QIDQ2673565zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

assignmentbottleneckrobustness and sensitivity analysis

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Sensitivity analysis of the optimal assignment.
• SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
• An addendum on: ``Sensitivity analysis of the optimal assignment
• Solution structures and sensitivity of special assignment problems
• A labeling algorithm for the sensitivity ranges of the assignment problem

Cites work

• A multi-level bottleneck assignment approach to the bus drivers' rostering problem
• A robust optimization solution to bottleneck generalized assignment problem under uncertainty
• An addendum on: ``Sensitivity analysis of the optimal assignment
• Assignment problems: a golden anniversary survey
• Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
• Improved polynomial algorithms for robust bottleneck problems with interval data
• Improving the Hungarian assignment algorithm
• Lexicographic bottleneck problems
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
• Sensitivity analysis in linear programming: Just be careful!
• SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
• Sensitivity analysis of the optimal assignment.
• Solution methods and computational investigations for the linear bottleneck assignment problem
• Some concepts of stability analysis in combinatorial optimization
• The Shifting Bottleneck Procedure for Job Shop Scheduling

Cited in

(14)

• Solution structures and sensitivity of special assignment problems
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
• Sensitivity analysis of the optimal assignment.
• Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
• An addendum on: ``Sensitivity analysis of the optimal assignment
• Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
• SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
• scientific article; zbMATH DE number 840699 (Why is no real title available?)
• Determining type II sensitivity ranges of the fractional assignment problem
• Sensitivity Analysis for Bottleneck Assignment Problems
• A labeling algorithm for the sensitivity ranges of the assignment problem
• Minimizing the maximum flow loss in the network maintenance scheduling problem with flexible arc outages
• Computation of lower tolerances of combinatorial bottleneck problems
• Extending the definition of single and set tolerances

This page was built for publication: Sensitivity analysis for bottleneck assignment problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673565)