The corridor allocation problem
From MaRDI portal
Recommendations
- Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem
- Optimal solutions for the double row layout problem
Cites work
- A new lower bound for the single row facility layout problem
- A polyhedral approach to the single row facility layout problem
- An Exact Approach to the One-Dimensional Facility Layout Problem
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Facets of the clique partitioning polytope
- Facets of the linear ordering polytope
- Global approaches for facility layout and VLSI floorplanning
- Multiprocessor scheduling under precedence constraints: polyhedral results
- On the exact solution of a facility layout problem
- One-Dimensional Space Allocation: An Ordering Algorithm
- Single row facility layout problem using a permutation-based genetic algorithm
- The double row layout problem
Cited in
(24)- Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- An improved mixed-integer programming model for the double row layout of facilities
- Multi-level departments-to-offices assignment with different room types
- Double-row facility layout with replicate machines and split flows
- scientific article; zbMATH DE number 3916023 (Why is no real title available?)
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Improved exact approaches for row layout problems with departments of equal length
- A decomposition-based algorithm for the double row layout problem
- Fast simulated annealing for single-row equidistant facility layout
- Between Broadway and the Hudson: A Bijection of Corridor Paths
- scientific article; zbMATH DE number 5152600 (Why is no real title available?)
- A \(0/1\) integer programming model for the office space allocation problem
- Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm
- New exact approaches to row layout problems
- Decorous combinatorial lower bounds for row layout problems
- An efficient variable neighborhood search for the space-free multi-row facility layout problem
- Iterated local search with ejection chains for the space-free multi-row facility layout problem
- The multiple checkpoint ordering problem
- Exact approaches for the combined cell layout problem
- A parallel ordering problem in facilities layout
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
- A mixed-integer programming formulation for optimizing the double row layout problem
This page was built for publication: The corridor allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339697)