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

Zhuo Fu (), Richard Eglese and Mike Wright
Additional contact information
Zhuo Fu: School of Traffic and Transportation Engineering, Central South University at Railway Campus, Changsha 410075, P. R. China
Richard Eglese: Lancaster University, Lancaster, UK
Mike Wright: School of Traffic and Transportation Engineering, Central South University at Railway Campus, Changsha 410075, P. R. China

Asia-Pacific Journal of Operational Research (APJOR), 2007, vol. 24, issue 06, 831-839

Abstract: Alternative optimal solutions can give more choice for practical decision making. Therefore, the provision of methods for finding alternative optimal solutions is an important component part of the solution techniques for optimization models. The aim of this paper is to present a branch-and-bound algorithm for finding all optimal solutions of the linear assignment problem. Numerical experimental results are also given.

Keywords: Linear programming; assignment problem; alternative optimal solutions; branch-and-bound (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595907001565
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:24:y:2007:i:06:n:s0217595907001565

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595907001565

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().