A cutting plane algorithm for graph coloring (Q2467348)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A cutting plane algorithm for graph coloring |
scientific article; zbMATH DE number 5228809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cutting plane algorithm for graph coloring |
scientific article; zbMATH DE number 5228809 |
Statements
A cutting plane algorithm for graph coloring (English)
0 references
21 January 2008
0 references
graph coloring
0 references
integer programming
0 references
facets of polyhedra
0 references
cutting plane algorithms
0 references
0 references
0.9318662881851196
0 references
0.8695099949836731
0 references
0.8644183874130249
0 references
0.830834150314331
0 references
0.8120282888412476
0 references
