A labeling algorithm for the sensitivity ranges of the assignment problem

DOI10.1016/j.apm.2011.03.045zbMath1228.90048OpenAlexW1989890932MaRDI QIDQ651673

Chi-Jen Lin

Publication date: 18 December 2011

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2011.03.045

zbMATH Keywords

sensitivity analysisdegeneracyassignment problemlabeling algorithm

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Discrete location and assignment (90B80)

Cites Work

• Approaches to sensitivity analysis in linear programming
• On dual solutions of the linear assignment problem
• Managing cost uncertainties in transportation and assignment problems
• Sensitivity analysis in linear programming: Just be careful!
• A new algorithm for the assignment problem: An alternative to the Hungarian method
• Sensitivity analysis of the optimal assignment.
• Algorithms and codes for dense assignment problems: The state of the art
• An addendum on: ``Sensitivity analysis of the optimal assignment
• Sensitivity analysis in linear optimization: invariant support set intervals
• SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
• A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM
• POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING
• Complementarity Theorems for Linear Programming

This page was built for publication: A labeling algorithm for the sensitivity ranges of the assignment problem