A wide branching strategy for the graph coloring problem
Year of publication: |
2014
|
---|---|
Authors: | Morrison, David Robert ; Sauppe, Jason J. ; Sewell, Edward C. ; Jacobson, Sheldon H. |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 26.2014, 4, p. 704-717
|
Subject: | graph coloring | integer programming | branch-and-price | computational experiments | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Integer programming | Experiment | Mathematische Optimierung | Mathematical programming |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
Sato, Keisuke, (2019)
-
Strong bounds and exact solutions to the minimum broadcast time problem
Ivanova, Marika, (2025)
- More ...
-
A network simplex algorithm for the equal flow problem on a generalized network
Morrison, David Robert, (2013)
-
Assigning panels to meeting rooms at the national science foundation
Sauppe, Jason J., (2015)
-
An optimization approach for making causal inferences
Cho, Wendy K. Tam, (2013)
- More ...