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 this page instead for the normal view: A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem |
scientific article |
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
