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

Integer Linear Programming: A Study in Computational Efficiency

Author

Listed:
  • C. A. Trauth, Jr.

    (Sandia Laboratories, Albuquerque, New Mexico)

  • R. E. Woolsey

    (Sandia Laboratories, Albuquerque, New Mexico)

Abstract

In this report, twenty-nine integer linear programming problems, raging from very simple to apparently rather difficult, are introduced. The results of running these problems on four different computer codes, involving five distinct algorithms, are presented as both time and iteration data. A brief description of the codes used is also included.

Suggested Citation

  • C. A. Trauth, Jr. & R. E. Woolsey, 1969. "Integer Linear Programming: A Study in Computational Efficiency," Management Science, INFORMS, vol. 15(9), pages 481-493, May.
    • Handle: RePEc:inm:ormnsc:v:15:y:1969:i:9:p:481-493
    DOI: 10.1287/mnsc.15.9.481
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.15.9.481
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.15.9.481?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. Avinoam Perry, 1974. "A Strengthened Modified Dantzig Cut for All Integer Program," Discussion Papers 95, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
    3. Avinoam Perry, 1974. "The Strengthened Gomory Mixed Integer Cut for the All Integer Program," Discussion Papers 93, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    4. Robert M. Saltzman & Frederick S. Hillier, 1991. "An exact ceiling point algorithm for general integer linear programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(1), pages 53-69, February.

    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:inm:ormnsc:v:15:y:1969:i:9:p:481-493. 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.