The corridor allocation problem
From MaRDI portal
Publication:339697
DOI10.1016/J.COR.2012.04.016zbMATH Open1349.90552OpenAlexW1966748173MaRDI QIDQ339697FDOQ339697
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.016
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
- Multiprocessor scheduling under precedence constraints: polyhedral results
- Facets of the clique partitioning polytope
- A new lower bound for the single row facility layout problem
- On the exact solution of a facility layout problem
- Global Approaches for Facility Layout and VLSI Floorplanning
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- An Exact Approach to the One-Dimensional Facility Layout Problem
- A polyhedral approach to the single row facility layout problem
- Single row facility layout problem using a permutation-based genetic algorithm
- One-Dimensional Space Allocation: An Ordering Algorithm
- The double row layout problem
- Facets of the linear ordering polytope
Cited In (22)
- A decomposition-based algorithm for the double row layout problem
- Exact approaches for the combined cell layout problem
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- Iterated local search with ejection chains for the space-free multi-row facility layout problem
- An improved mixed-integer programming model for the double row layout of facilities
- Title not available (Why is that?)
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- Multi-level departments-to-offices assignment with different room types
- Double-row facility layout with replicate machines and split flows
- Decorous combinatorial lower bounds for row layout problems
- New exact approaches to row layout problems
- An efficient variable neighborhood search for the space-free multi-row facility layout problem
- Between Broadway and the Hudson: A Bijection of Corridor Paths
- Improved exact approaches for row layout problems with departments of equal length
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- A parallel ordering problem in facilities layout
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
- Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem
- Title not available (Why is that?)
- Fast simulated annealing for single-row equidistant facility layout
- Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective 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)
