Algorithms for minclique scheduling problems (Q5961609): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Tabu search / rank | |||
Normal rank | |||
Revision as of 00:02, 1 March 2024
scientific article; zbMATH DE number 981906
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for minclique scheduling problems |
scientific article; zbMATH DE number 981906 |
Statements
Algorithms for minclique scheduling problems (English)
0 references
25 February 1997
0 references
spectral algorithms
0 references
tabu search
0 references
scheduling problems
0 references
minimum weighted clique
0 references
complete weighted graph
0 references
negative weights
0 references
self-loops
0 references
