A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2011.05.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039313449 / rank | |||
Normal rank | |||
Revision as of 00:12, 20 March 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
