A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00291-010-0204-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964361678 / rank | |||
Normal rank | |||
Revision as of 21:59, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the single-row equidistant facility layout problem |
scientific article |
Statements
A branch-and-bound algorithm for the single-row equidistant facility layout problem (English)
0 references
23 May 2012
0 references
facility layout
0 references
quadratic assignment problem
0 references
branch-and-bound algorithm
0 references
tabu search
0 references
