IDEAS home Printed from https://ideas.repec.org/p/ags/harcia/294535.html
   My bibliography  Save this paper

A Branch and Bound Algorithm for Zero-One Mixed Integer Programming Problems

Author

Listed:
  • Davis, Ronald
  • Kendrick, David
  • Weitzman, Martin

Abstract

This paper presents the results of experimentation on the development of an efficient branch-and-bound algorithm for the solution of zero-one linear mixed integer programming problems. An implicit enumeration is employed using bounds that are obtained from the fractional variables in the associated linear programming problem. The principal mathematical result used in obtaining these bounds is the piecewise linear convexity of the criterion function with respect to changes of a single variable in the interval [0, 1]. A comparison with the computational experience obtained with several other algorithms on a number of problems is included.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Davis, Ronald & Kendrick, David & Weitzman, Martin, 1967. "A Branch and Bound Algorithm for Zero-One Mixed Integer Programming Problems," Center for International Affairs (CIA) Archive 294535, Harvard University, Center for International Affairs.
    • Handle: RePEc:ags:harcia:294535
    DOI: 10.22004/ag.econ.294535
    as

    Download full text from publisher

    File URL: https://ageconsearch.umn.edu/record/294535/files/harvard081.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.22004/ag.econ.294535?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
    ---><---

    Other versions of this item:

    More about this item

    Keywords

    Research Methods/ Statistical Methods;

    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:ags:harcia:294535. 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: AgEcon Search (email available below). General contact details of provider: https://edirc.repec.org/data/wcharus.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.