A labeling algorithm for the sensitivity ranges of the assignment problem
From MaRDI portal
Recommendations
- Determining type II sensitivity ranges of the fractional assignment problem
- 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
- Sensitivity analysis for bottleneck assignment problems
Cites work
- A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM
- A new algorithm for the assignment problem: An alternative to the Hungarian method
- Algorithms and codes for dense assignment problems: The state of the art
- An addendum on: ``Sensitivity analysis of the optimal assignment
- Approaches to sensitivity analysis in linear programming
- Complementarity Theorems for Linear Programming
- Managing cost uncertainties in transportation and assignment problems
- On dual solutions of the linear assignment problem
- POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING
- SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
- Sensitivity analysis in linear optimization: invariant support set intervals
- Sensitivity analysis in linear programming: Just be careful!
- Sensitivity analysis of the optimal assignment.
Cited in
(7)- An addendum on: ``Sensitivity analysis of the optimal assignment
- Adaptive labeling algorithms for the dynamic assignment problem
- Determining type II sensitivity ranges of the fractional assignment problem
- scientific article; zbMATH DE number 1057929 (Why is no real title available?)
- Sensitivity analysis for bottleneck assignment problems
- Type II sensitivity analysis of cost coefficients in the degenerate transportation problem
- SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
This page was built for publication: A labeling algorithm for the sensitivity ranges of the assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651673)