An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Tabu search / rank | |||
Normal rank | |||
Revision as of 09:29, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An unconstrained quadratic binary programming approach to the vertex coloring problem |
scientific article |
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
