Algorithms for minclique scheduling problems (Q5961609)
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: Algorithms for minclique scheduling problems |
scientific article; zbMATH DE number 981906
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0.7688672542572021
0 references
0.7588879466056824
0 references
0.7547481060028076
0 references
