Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes (Q2901038)
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: Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes |
scientific article; zbMATH DE number 6060405
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes |
scientific article; zbMATH DE number 6060405 |
Statements
28 July 2012
0 references
single-row facility layout
0 references
space allocation
0 references
semidefinite programming
0 references
Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes (English)
0 references
0.9097428917884828
0 references
0.8695697784423828
0 references
0.8423871994018555
0 references
0.8323183059692383
0 references
0.8113742470741272
0 references
