A branch and bound method for solving the bidirectional circular layout problem (Q5961820): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:27, 30 January 2024
scientific article; zbMATH DE number 983104
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
