| Article ID: | iaor20011519 |
| Country: | United States |
| Volume: | 47 |
| Issue: | 5 |
| Start Page Number: | 789 |
| End Page Number: | 791 |
| Publication Date: | Sep 1999 |
| Journal: | Operations Research |
| Authors: | Wilhelm Wilbert, Parija Gyana, Gadidov Radu |
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.