A Facet Generation Procedure for Solving 0/1 Integer Programs
Published Online:1 Oct 1999https://doi.org/10.1287/opre.47.5.789
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.
