Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5552078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results |
scientific article; zbMATH DE number 5552078 |
Statements
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (English)
0 references
7 May 2009
0 references
graph coloring
0 references
stable sets
0 references
facets
0 references
branch-cut-and-price algorithm
0 references
0 references
0.8977983
0 references
0.89767236
0 references
0.89278597
0 references
0.8910066
0 references
0.8886392
0 references
0 references
0.88491046
0 references
0 references
0.8845282
0 references
