A Branch-And-Bound Algorithm For Finding All Optimal Solutions Of The Assignment Problem
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 24 (2007)
Issue (Month): 06 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/apjor/apjor.shtml|
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:24:y:2007:i:06:p:831-839. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)
If references are entirely missing, you can add them using this form.