A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM

DOI10.1142/S0217595907001565zbMath1200.90115OpenAlexW2065751936MaRDI QIDQ3502867

Zhuo Fu, Mike Wright, Richard W. Eglese

Publication date: 20 May 2008

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595907001565

zbMATH Keywords

alternative optimal solutions

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (2)

Regularization of DAEs based on the signature method ⋮ A labeling algorithm for the sensitivity ranges of the assignment problem

Cites Work

• Unnamed Item
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Sensitivity analysis of the optimal assignment.
• Speeding up the Hungarian algorithm
• Algorithms and codes for dense assignment problems: The state of the art
• An addendum on: ``Sensitivity analysis of the optimal assignment
• An algorithm to solve them ×n assignment problem in expected timeO(mn logn)
• Solving the Assignment Problem by Relaxation
• Navy Personnel Planning and the Optimal Partition
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

This page was built for publication: A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM