IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v32y1985i4p613-623.html
   My bibliography  Save this article

A heuristic with tie breaking for certain 0–1 integer programming models

Author

Listed:
  • G. Edward Fox
  • Gary D. Scudder

Abstract

A heuristic for 0–1 integer programming is proposed that features a specific rule for breaking ties that occur when attempting to determine a variable to set to 1 during a given iteration. It is tested on a large number of small‐ to moderate‐sized randomly generated generalized set‐packing models. Solutions are compared to those obtained using an existing well‐regarded heuristic and to solutions to the linear programming relaxations. Results indicate that the proposed heuristic outperforms the existing heuristic except for models in which the number of constraints is large relative to the number of variables. In this case, it performs on par with the existing heuristic. Results also indicate that use of a specific rule for tie breaking can be very effective, especially for low‐density models in which the number of variables is large relative to the number of constraints.

Suggested Citation

  • G. Edward Fox & Gary D. Scudder, 1985. "A heuristic with tie breaking for certain 0–1 integer programming models," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 32(4), pages 613-623, November.
    • Handle: RePEc:wly:navlog:v:32:y:1985:i:4:p:613-623
    DOI: 10.1002/nav.3800320408
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800320408
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800320408?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. G. Edward Fox & Christopher J. Nachtsheim, 1990. "An analysis of six greedy selection rules on a class of zero‐one integer programming models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 299-307, April.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navlog:v:32:y:1985:i:4:p:613-623. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.