A Facet Generation Procedure for Solving 0/1 Integer Programs

Authors:
Gyana Parija;Radu Gadidov;Wilbert Wilhelm
Affiliations:
-;-;-
Venue:
Operations Research
Year:
1999

Citing 0
Cited 1

Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs

Optimization Methods & Software - GLOBAL OPTIMIZATION

Quantified Score

Hi-index	0.00

Visualization

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.