An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187)
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: An unconstrained quadratic binary programming approach to the vertex coloring problem |
scientific article; zbMATH DE number 5009772
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An unconstrained quadratic binary programming approach to the vertex coloring problem |
scientific article; zbMATH DE number 5009772 |
Statements
An unconstrained quadratic binary programming approach to the vertex coloring problem (English)
0 references
7 March 2006
0 references
graph coloring
0 references
combinatorial optimization
0 references
tabu search
0 references
0 references
0 references
0 references
0 references
