Cutting Planes from Conditional Bounds for Generalized Set Covering Problems

Pato, Margarida Vaz; Paixão, José Pinto

http://hdl.handle.net/10400.5/96252

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
Cutting Planes from Conditional Bounds for Generalized Set Covering Problems_IO_ vol.9_pp.13-21_1989.pdf		352.95 KB	Adobe PDF	Download

Send Feedback

Authors

Pato, Margarida Vaz

Paixão, José Pinto

Abstract(s)

This paper reports on the development of special cutting planes for the generalized set covering problem, GSCP, which is a covering problem where the variables and the right-hand sides are allowed to have any positive integer value. Those inequalities are, actually, a generalization of the cutting planes derived from conditional bounds and originally presented by Balas (1980), for the set covering problem. More recently, Hall & Hochbaum (1985) have extended those results for the multicovering problem. The generalized inequalities that we derive for the GSCP arc proved to be of the covering type and, hence, keeping the structure of the problem constraints.

Keywords

Cutting Planes Conditional Bounds Disjunctive Inequalities Generalized Set Covering Problem

URI

http://hdl.handle.net/10400.5/96252

Citation

Pato, Margarida Vaz and José Pinto Paixão .(1989). “ Cutting Planes from Conditional Bounds for Generalized Set Covering Problems”. Investigação Operacional, Vol. 9 (1989), pp. 13-21.