A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371)
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 6022215
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem |
scientific article; zbMATH DE number 6022215 |
Statements
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (English)
0 references
5 April 2012
0 references
frequency assignment
0 references
adjacent colors
0 references
integer programming
0 references
0 references
0.7393141984939575
0 references
0.7291485071182251
0 references
0.7244714498519897
0 references
