IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v32y1986i9p1095-1103.html
   My bibliography  Save this article

A Multiplier Adjustment Method for the Generalized Assignment Problem

Author

Listed:
  • Marshall L. Fisher

    (The Wharton School, University of Pennsylvania, Philadelphia, Pennsylvania 19104)

  • R. Jaikumar

    (School of Business, Harvard University, Boston, Massachusetts 02160)

  • Luk N. Van Wassenhove

    (Katholieke Universiteit Leuven)

Abstract

We describe a branch and bound algorithm for the generalized assignment problem in which bounds are obtained from a Lagrangian relaxation with the multipliers set by a heuristic adjustment method. The algorithm was tested on a large sample of small random problems and a number of large problems derived from a vehicle routing application. Computation times were reasonable in all cases and the branch and bound trees generated had nearly two orders of magnitude fewer nodes than for competing algorithms. Although comparison of running times on different machines is difficult, the multiplier adjustment method appears to be about one order of magnitude faster than the best previously existing algorithms for this problem.

Suggested Citation

  • Marshall L. Fisher & R. Jaikumar & Luk N. Van Wassenhove, 1986. "A Multiplier Adjustment Method for the Generalized Assignment Problem," Management Science, INFORMS, vol. 32(9), pages 1095-1103, September.
    • Handle: RePEc:inm:ormnsc:v:32:y:1986:i:9:p:1095-1103
    DOI: 10.1287/mnsc.32.9.1095
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.32.9.1095
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.32.9.1095?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
    ---><---

    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:inm:ormnsc:v:32:y:1986:i:9:p:1095-1103. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.