The minimum chromatic violation problem: a polyhedral approach (Q2184668)
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 7206527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum chromatic violation problem: a polyhedral approach |
scientific article; zbMATH DE number 7206527 |
Statements
The minimum chromatic violation problem: a polyhedral approach (English)
0 references
29 May 2020
0 references
chromatic violation
0 references
graph coloring
0 references
polyhedral study
0 references
\(k\)-partition
0 references
0 references
0.9767457246780396
0 references
0.7383901476860046
0 references
0.7270152568817139
0 references
0.7261708378791809
0 references
0.7222208380699158
0 references
