A column generation approach for exact graph coloring
Conference
·
OSTI ID:36277
We present a method for solving the independent set formulation of the graph coloring problem (where there is one variable for each independent set in the graph). We use a column generation method for implicit optimization of the linear program at each node of the branch-and-bound tree. This approach, while requiring the solution of a difficult subproblem as well as needing sophisticated branching rules, solves small to moderate size problems quickly. Implementation details and computational experience are also presented.
- OSTI ID:
- 36277
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Branch-and-cut: Column generation for solving huge integer programs
Iterated greedy graph coloring and the coloring landscape
New advances in the GOP algorithm for global optimization
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36337
Iterated greedy graph coloring and the coloring landscape
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35928
New advances in the GOP algorithm for global optimization
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36016