IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v52y2001i5d10.1057_palgrave.jors.2601111.html
   My bibliography  Save this article

Preprocessing rules for integer programming solutions to the generalised assignment problem

Author

Listed:
  • M-T Kong

    (Imperial College of Science, Technology and Medicine)

  • N Shah

    (Imperial College of Science, Technology and Medicine)

Abstract

Several preprocessing rules to reduce integer programming problem size are proposed and examined for the generalised assignment problem. The rules make use of the linear programming relaxation and ranking on the basis of a combined resource/cost metric. Computational experiments with commercial branch and bound solvers have been performed using publicly available problem data from the OR library. Results are promising as the preprocessed problem solves to within 1% of the full problem with significantly less CPU time for most of the test problems examined.

Suggested Citation

  • M-T Kong & N Shah, 2001. "Preprocessing rules for integer programming solutions to the generalised assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(5), pages 567-575, May.
    • Handle: RePEc:pal:jorsoc:v:52:y:2001:i:5:d:10.1057_palgrave.jors.2601111
    DOI: 10.1057/palgrave.jors.2601111
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601111
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601111?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:pal:jorsoc:v:52:y:2001:i:5:d:10.1057_palgrave.jors.2601111. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.