A Wide Branching Strategy for the Graph Coloring Problem (Q2940061): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 22:48, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Wide Branching Strategy for the Graph Coloring Problem |
scientific article |
Statements
A Wide Branching Strategy for the Graph Coloring Problem (English)
0 references
26 January 2015
0 references
graph coloring
0 references
integer programming
0 references
branch-and-price
0 references
computational experiments
0 references
