Letter to the Editor—On the Merit of the Generalized Origin and Restarts in Implicit Enumeration

Harvey M. Salkin
Additional contact information
Harvey M. Salkin: Case Western Reserve University, Cleveland, Ohio

Operations Research, 1970, vol. 18, issue 3, 549-555

Abstract: This note discusses the concept of starting a (zero-one) tree search at an integer solution obtained from the associated linear program and restarting it at improved feasible solutions. Computational experience indicates that the length of the enumeration is inversely proportional to the closeness of the origin to the minimal integer vector.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.3.549 (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:18:y:1970:i:3:p:549-555

Access Statistics for this article

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