Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions

Hanif D. Sherali and Suvrajeet Sen
Additional contact information
Hanif D. Sherali: Virginia Polytechnic Institute and State University, Blacksburg, Virginia
Suvrajeet Sen: University of Arizona, Tucson, Arizona

Operations Research, 1985, vol. 33, issue 4, 928-933

Abstract: This paper develops a technique for generating deep valid inequalities based on combinatorial disjunctions that state that at least p out of some q (≥ p ) constraints must be satisfied. This technique provides a general framework, which subsumes existing methods, for generating cutting planes based on such disjunctions. It has potential applications, for example, in multiple choice and generalized lattice point programming problems, including mixed-integer zero-one programming problems and the extreme point mathematical programming problem.

Keywords: 628; cutting; plane; algorithms (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.4.928 (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:33:y:1985:i:4:p:928-933

Access Statistics for this article

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