A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A Facet Generation Procedure for Solving 0/1 Integer Programs
1999
Operations Research
Preserved Fulltext
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.
doi:10.1287/opre.47.5.789
fatcat:7eo626huuvet7he3kjsqp43gw4