The following pages link to The corridor allocation problem (Q339697):
Displayed 17 items.
- A parallel ordering problem in facilities layout (Q336660) (← links)
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm (Q337195) (← links)
- Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- An improved mixed-integer programming model for the double row layout of facilities (Q1733337) (← links)
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
- A decomposition-based algorithm for the double row layout problem (Q1988733) (← links)
- Multi-level departments-to-offices assignment with different room types (Q2002846) (← links)
- Double-row facility layout with replicate machines and split flows (Q2003412) (← links)
- Exact approaches for the combined cell layout problem (Q2098024) (← links)
- Decorous combinatorial lower bounds for row layout problems (Q2189888) (← links)
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem (Q2239887) (← links)
- An efficient variable neighborhood search for the space-free multi-row facility layout problem (Q2242375) (← links)
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem (Q2255905) (← links)
- New exact approaches to row layout problems (Q2295979) (← links)
- Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem (Q2668724) (← links)
- Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm (Q3296256) (← links)