New exact approaches to row layout problems
From MaRDI portal
Publication:2295979
DOI10.1007/s12532-019-00162-6zbMath1432.90085OpenAlexW2944447346WikidataQ127886919 ScholiaQ127886919MaRDI QIDQ2295979
Philipp Hungerländer, Anja Fischer, Frank Fischer
Publication date: 17 February 2020
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-019-00162-6
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (6)
Strong SDP based bounds on the cutwidth of a graph ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem ⋮ An efficient variable neighborhood search for the space-free multi-row facility layout problem ⋮ Mathematical optimization approach for facility layout on several rows ⋮ Exact approaches for the combined cell layout problem
Uses Software
Cites Work
- Unnamed Item
- A semidefinite optimization-based approach for global optimization of multi-row facility layout
- Single row layout models
- Fast local search for single row facility layout
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
- A parallel ordering problem in facilities layout
- Insertion based Lin-Kernighan heuristic for single row facility layout
- The corridor allocation problem
- A computational study and survey of methods for the single-row facility layout problem
- Semidefinite relaxations of ordering problems
- A polyhedral approach to the single row facility layout problem
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- Single row facility layout problem using a permutation-based genetic algorithm
- A polyhedral study of triplet formulation for single row facility layout problem
- Integrating design and production planning considerations in multi-bay manufacturing facility layout
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
- Efficient models for the facility layout problem
- A survey for the quadratic assignment problem
- A new lower bound for the single row facility layout problem
- Some simplified NP-complete graph problems
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
- Improved exact approaches for row layout problems with departments of equal length
- An improved mixed-integer programming model for the double row layout of facilities
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Optimal linear arrangements using betweenness variables
- Optimal solutions for the double row layout problem
- The single row facility layout problem: state of the art
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- An efficient tabu algorithm for the single row facility layout problem
- Combining simulation and optimization for extended double row facility layout problems in factory planning
- An efficient genetic algorithm for single row facility layout
- On the exact solution of a facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Global Approaches for Facility Layout and VLSI Floorplanning
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- The double row layout problem
- A Cutting Plane Algorithm for the Linear Ordering Problem
- An Exact Approach to the One-Dimensional Facility Layout Problem
- Provably near-optimal solutions for very large single-row facility layout problems
- Facets of the linear ordering polytope
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- The multi-bay manufacturing facility layout problem
- Machine layout problem in modern manufacturing facilities
- A New Exact Approach to the Space-Free Double Row Layout Problem
- Construction heuristics for the single row layout problem with machine-spanning clearances
This page was built for publication: New exact approaches to row layout problems
