Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques (Q1013296)
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: Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques |
scientific article; zbMATH DE number 5544688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques |
scientific article; zbMATH DE number 5544688 |
Statements
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques (English)
0 references
17 April 2009
0 references
bandwidth allocation
0 references
polyhedral combinatorics
0 references
facets
0 references
separation
0 references
0.9339450001716614
0 references
0.8871011734008789
0 references
0.8860157132148743
0 references
0.8815885186195374
0 references
