An addendum on: ``Sensitivity analysis of the optimal assignment

DOI10.1016/j.ejor.2004.09.015zbMath1101.90387OpenAlexW1973362730MaRDI QIDQ2569122

A. Volgenant

Publication date: 17 October 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.015

zbMATH Keywords

sensitivity analysisassignment

Mathematics Subject Classification ID

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

Related Items

The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems, Extending single tolerances to set tolerances, Efficient computation of tolerances in the weighted independent set problem for trees, Sensitivity analysis for bottleneck assignment problems, A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM, Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem, Efficient computation of tolerances in the weighted independent set problem for some classes of graphs, A labeling algorithm for the sensitivity ranges of the assignment problem, A tolerance-based heuristic approach for the weighted independent set problem, Lower tolerance-based branch and bound algorithms for the ATSP, Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem, Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems

Cites Work

• On dual solutions of the linear assignment problem
• Solving some lexicographic multi-objective combinatorial problems
• Sensitivity analysis of the optimal assignment.
• Algorithms and codes for dense assignment problems: The state of the art