Integer programming by implicit enumeration and Balas' method

A. M. Geoffrion

ResearchPublished 1966

A reformulation of the essentials of Balas' algorithm for the zero-one integer linear programming problem. The study is based upon the concept of "elementary tree search" used by Glover as the basis of his multi-phase-dual algorithm. The reformulation requires much less computer storage than the original version; it also clarifies the rationale behind the algorithm, thereby leading naturally to variants and extensions. 28 pp.

Document Details

Citation

Chicago Manual of Style

Geoffrion, A. M., Integer programming by implicit enumeration and Balas' method. Santa Monica, CA: RAND Corporation, 1966. https://www.rand.org/pubs/research_memoranda/RM4783.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.