A branch and bound method for solving the bidirectional circular layout problem (Q5961820): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126666733, #quickstatements; #temporary_batch_1719432696450 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0307-904x(95)00124-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055423535 / rank | |||
Normal rank | |||
Latest revision as of 11:07, 30 July 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
0 references
