IDEAS home Printed from https://ideas.repec.org/a/wsi/ijitdm/v01y2002i01ns0219622002000026.html
   My bibliography  Save this article

An Effective Approach For Solving The Binary Assignment Problem With Side Constraints

Author

Listed:
  • GARY KOCHENBERGER

    (School of Business, University of Colorado at Denver, Campus box 165, P.O. Box 173364, Denver, CO 80217-3364, USA)

  • FRED GLOVER

    (School of Business, University of Colorado at Boulder, USA)

  • BAHRAM ALIDAEE

    (Hearin Center for Enterprise Science, University of Mississippi, USA)

Abstract

The binary assignment problem with a side constraint requiring the objective function to receive a specified value, which in general is an NP-hard problem, has been the focus of several papers in recent years. The current literature addresses various theoretical aspects of the problem, with a particular emphasis on a simplifying special case, but stops short of giving any computational experience. In this paper, we present a simple reformulation that enables the problem, and some of its extensions, to be solved by commonly available heuristic methods. We present preliminary computational experience with a Tabu search method that illustrates the effectiveness and computational robustness of the approach.

Suggested Citation

  • Gary Kochenberger & Fred Glover & Bahram Alidaee, 2002. "An Effective Approach For Solving The Binary Assignment Problem With Side Constraints," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 1(01), pages 121-129.
    • Handle: RePEc:wsi:ijitdm:v:01:y:2002:i:01:n:s0219622002000026
    DOI: 10.1142/S0219622002000026
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219622002000026
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219622002000026?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijitdm:v:01:y:2002:i:01:n:s0219622002000026. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijitdm/ijitdm.shtml .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.