Pages that link to "Item:Q421088"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088):
Displaying 8 items.
- Single row layout models (Q319651) (← links)
- Fast local search for single row facility layout (Q319872) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
- Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
- Decorous combinatorial lower bounds for row layout problems (Q2189888) (← links)
- New exact approaches to row layout problems (Q2295979) (← links)
- The deterministic product location problem under a pick-by-order policy (Q2446876) (← links)
