Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables

Monique Guignard and Kurt Spielberg
Additional contact information
Monique Guignard: University of Pennsylvania, Philadelphia, Pennsylvania
Kurt Spielberg: IBM Corporation, White Plains, New York

Operations Research, 1981, vol. 29, issue 1, 49-74

Abstract: In the first part of this paper, the concept of logical reduction is presented Minimal preferred variable inequalities are introduced, and algorithms are given for their calculation. A simple illustrative example is carried along from the start, further examples are provided later. The second part of the paper describes certain properties of the generated logical inequalities. It then explains some of the decreases of computational effort which may be achieved by the use of minimal preferred inequalities and outlines a number of concrete applications with some numerical results. Finally, a number of more recent concepts and results are discussed, among them the notion of “probing” and a related zero-one enumeration code for large scale problems under the extended control language of MPSX/370.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.1.49 (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:29:y:1981:i:1:p:49-74

Access Statistics for this article

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