A branch and bound method for solving the bidirectional circular layout problem (Q5961820)
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: A branch and bound method for solving the bidirectional circular layout problem |
scientific article; zbMATH DE number 983104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound method for solving the bidirectional circular layout problem |
scientific article; zbMATH DE number 983104 |
Statements
A branch and bound method for solving the bidirectional circular layout problem (English)
0 references
24 April 1997
0 references
facility layout
0 references
generalized linear ordering problem
0 references
manufacturing systems
0 references
quadratic assignment problem
0 references
discrete layout
0 references
bidirectional circular layout problem
0 references
0 references
0.804745614528656
0 references
0.7984553575515747
0 references
0.7505144476890564
0 references
0.7483315467834473
0 references
0.7475275993347168
0 references
