A Facet Generation Procedure for Solving 0/1 Integer Programs

Gyana Parija, Radu Gadidov and Wilbert Wilhelm
Additional contact information
Gyana Parija: IBM Corporation, Poughkeepsie, New York 12601
Radu Gadidov: Emery Worldwide Airlines, Vandalia, Ohio 45377
Wilbert Wilhelm: Texas A&M University, College Station, Texas 77843-3131

Operations Research, 1999, vol. 47, issue 5, 789-791

Abstract: This paper presents the Facet Generation Procedure (FGP) for solving 0/1 integer programs. The FGP seeks to identify a hyperplane that represents a facet of an underlying polytope to cut off the fractional solution to the linear programming relaxation of the integer programming problem. A set of standard problems is used to provide insight into the computational characteristics of the procedure.

Keywords: programming; integer; cutting plane/facet; generating facets computationally (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.47.5.789 (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:47:y:1999:i:5:p:789-791

Access Statistics for this article

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