Solving set covering problems with general cutting planes
Conference
·
OSTI ID:35882
We show how general cutting planes can be used within a branch-and-cut framework to solve difficult set-covering and partitioning problems. Our approach uses both lift-and-project and Gomory`s fractional cuts to strengthen the linear programming formulation of the set covering/partitioning problem. The result is a robust solver, which can also be used when side constraints are present. We present computational experience on a variety of real-world instances.
- OSTI ID:
- 35882
- Report Number(s):
- CONF-9408161-; TRN: 94:009753-0144
- Resource Relation:
- Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Solving multiple knapsack problems by cutting planes
A branch-and-cut algorithm for the bandwidth packing problem
Solving set partitioning problems arising in handicapped people`s transport
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:35882
A branch-and-cut algorithm for the bandwidth packing problem
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:35882
Solving set partitioning problems arising in handicapped people`s transport
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:35882