Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315)
From MaRDI portal
(Redirected from Item:Q2293097)
 | 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: Breaking symmetries to rescue sum of squares in the case of makespan scheduling |
scientific article; zbMATH DE number 7164376
- Breaking symmetries to rescue sum of squares: the case of makespan scheduling
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking symmetries to rescue sum of squares in the case of makespan scheduling |
scientific article; zbMATH DE number 7164376 |
|
Statements
Breaking symmetries to rescue sum of squares in the case of makespan scheduling (English)
0 references
Breaking symmetries to rescue sum of squares: the case of makespan scheduling (English)
0 references
28 August 2020
0 references
6 February 2020
0 references
makespan scheduling
0 references
polynomial optimization
0 references
approximation algorithms
0 references
symmetry breaking
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9922322034835817
0 references
0.82611483335495
0 references
0.8217606544494629
0 references
0.7889866232872009
0 references
0.7815377116203308
0 references
