A Flexible Enumeration Scheme for Zero-One Programming

Leon B. Ellwein
Additional contact information
Leon B. Ellwein: JRB Associates, La Jolla, California

Operations Research, 1974, vol. 22, issue 1, 144-150

Abstract: Each of the main enumerative methods for zero-one programming has a drawback: the branch-and-bound (multi-branch) approach may require an inordinate amount of storage capacity and the backtrack implicit-enumeration (single-branch) approach circumvents this storage problem only by restricting the flexibility of the search. This paper outlines an implicit-enumeration scheme that, while maintaining a low storage requirement, allows the same flexibility in backward branching (backtracking is no longer mandatory) as we commonly have in forward branching. Preliminary computational results are presented.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.1.144 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:22:y:1974:i:1:p:144-150

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().