Advanced Search
MyIDEAS: Login to save this article or follow this journal

A Branch-And-Bound Algorithm For Finding All Optimal Solutions Of The Assignment Problem

Contents:

Author Info

  • 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)

Registered author(s):

    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.

    Download Info

    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.
    File URL: http://www.worldscinet.com/cgi-bin/details.cgi?type=pdf&id=pii:S0217595907001565
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: http://www.worldscinet.com/cgi-bin/details.cgi?type=html&id=pii:S0217595907001565
    Download Restriction: Access to full text is restricted to subscribers.

    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.

    Bibliographic Info

    Article provided by World Scientific Publishing Co. Pte. Ltd. in its journal Asia-Pacific Journal of Operational Research.

    Volume (Year): 24 (2007)
    Issue (Month): 06 ()
    Pages: 831-839

    as in new window
    Handle: RePEc:wsi:apjorx:v:24:y:2007:i:06:p:831-839

    Contact details of provider:
    Web page: http://www.worldscinet.com/apjor/apjor.shtml

    Order Information:
    Email:

    Related research

    Keywords: Linear programming; assignment problem; alternative optimal solutions; branch-and-bound;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.