A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISOPT.2011.05.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISOPT.2011.05.003 / rank | |||
Normal rank | |||
Latest revision as of 16:42, 9 December 2024
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
0 references
