A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:48, 30 January 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
