A branch-and-cut algorithm for graph coloring (Q2489906): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 02:35, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for graph coloring |
scientific article |
Statements
A branch-and-cut algorithm for graph coloring (English)
0 references
28 April 2006
0 references
graph coloring
0 references
integer programming
0 references
branch-and-cut algorithms
0 references
