Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328)
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: Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations |
scientific article; zbMATH DE number 5634704
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations |
scientific article; zbMATH DE number 5634704 |
Statements
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (English)
0 references
17 November 2009
0 references
scheduling
0 references
quadratic programming
0 references
convex reformulations
0 references
parallel machines
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9412798
0 references
0.91575724
0 references
0.91411483
0 references
0.9134105
0 references
0 references
0.9039574
0 references
0 references
0.8992594
0 references
