The minimum chromatic violation problem: a polyhedral study (Q2413191)
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 6857307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum chromatic violation problem: a polyhedral study |
scientific article; zbMATH DE number 6857307 |
Statements
The minimum chromatic violation problem: a polyhedral study (English)
0 references
9 April 2018
0 references
vertex coloring
0 references
integer programming
0 references
chromatic violation
0 references
0.9767457246780396
0 references
0.7606871128082275
0 references
0.7442874908447266
0 references
0.7382591962814331
0 references
0.7344801425933838
0 references
