Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
Year of publication: |
2016
|
---|---|
Authors: | Morrison, David Robert ; Sewell, Edward C. ; Jacobson, Sheldon H. |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 28.2016, 1, p. 67-82
|
Subject: | branch and price | binary decision diagrams | graph coloring | Graphentheorie | Graph theory |
-
Towards objective measures of algorithm performance across instance space
Smith-Miles, Kate, (2014)
-
Optimal shift coloring of trees
Adreatta, Giovanni, (2014)
-
An exact algorithm with learning fr the graph coloring problem
Zhou, Zhaoyang, (2014)
- More ...
-
Morrison, David Robert, (2014)
-
A wide branching strategy for the graph coloring problem
Morrison, David Robert, (2014)
-
A network simplex algorithm for the equal flow problem on a generalized network
Morrison, David Robert, (2013)
- More ...