A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531)
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 heuristic for the stability number of a graph based on convex quadratic programming and tabu search |
scientific article; zbMATH DE number 5660171
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for the stability number of a graph based on convex quadratic programming and tabu search |
scientific article; zbMATH DE number 5660171 |
Statements
A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (English)
0 references
19 January 2010
0 references
