Beating the SDP bound for the floor layout problem: a simple combinatorial idea (Q5882276)
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: Beating the SDP bound for the floor layout problem: a simple combinatorial idea |
scientific article; zbMATH DE number 7663327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beating the SDP bound for the floor layout problem: a simple combinatorial idea |
scientific article; zbMATH DE number 7663327 |
Statements
Beating the SDP bound for the floor layout problem: a simple combinatorial idea (English)
0 references
15 March 2023
0 references
layout
0 references
integer programming
0 references
0 references
0 references
0 references
0 references
0.7426968812942505
0 references
0.7100556492805481
0 references
0.7091746926307678
0 references
0.7075197696685791
0 references
0.7002701163291931
0 references
