Branch-and-cut: Column generation for solving huge integer programs
Conference
·
OSTI ID:36337
We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branch-and-bound tree. We present classes of models for which this approach decomposes the problem, provides tighter LP relaxations, and eliminates symmetry. We then discuss computational issues and implementation of column generation, branch-and-bound algorithms, including special branching rules.
- OSTI ID:
- 36337
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
A branch-and-cut algorithm for the generalized communication tree network design
A column generation approach for exact graph coloring
Control strategies for parallel mixed integer branch and bound
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36205
A column generation approach for exact graph coloring
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36277
Control strategies for parallel mixed integer branch and bound
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87609