A computational study and survey of methods for the single-row facility layout problem
From MaRDI portal
Publication:354626
DOI10.1007/S10589-012-9505-8zbMATH Open1272.90070OpenAlexW2063394514MaRDI QIDQ354626FDOQ354626
Authors: Philipp Hungerländer, Franz Rendl 
Publication date: 19 July 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9505-8
Recommendations
- The single row facility layout problem: state of the art
- Provably near-optimal solutions for very large single-row facility layout problems
- A polyhedral approach to the single row facility layout problem
- A new lower bound for the single row facility layout problem
- On the exact solution of a facility layout problem
Cites Work
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Title not available (Why is that?)
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Geometry of cuts and metrics
- Some simplified NP-complete graph problems
- On the cut polytope
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A new lower bound for the single row facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- An efficient tabu algorithm for the single row facility layout problem
- A new heuristic for the linear placement problem
- 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
- An Exact Approach to the One-Dimensional Facility Layout Problem
- Provably near-optimal solutions for very large single-row facility layout problems
- Semidefinite relaxations of ordering problems
- A polyhedral approach to the single row facility layout problem
- On the One-Dimensional Space Allocation Problem
- Single row facility layout problem using a permutation-based genetic algorithm
- One-Dimensional Space Allocation: An Ordering Algorithm
- A polyhedral study of triplet formulation for single row facility layout problem
- Efficient models for the facility layout problem
- Methods for the one-dimensional space allocation problem
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- A heuristic procedure for the single-row facility layout problem
- The cut polytope and the Boolean quadric polytope
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Exact algorithms for the quadratic linear ordering problem
- An SDP approach to multi-level crossing minimization
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Finite-State Processes and Dynamic Programming
- An r-Dimensional Quadratic Placement Algorithm
Cited In (39)
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- 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 Exact Approach to the One-Dimensional Facility Layout Problem
- Provably near-optimal solutions for very large single-row facility layout problems
- Mathematical optimization approach for facility layout on several rows
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- A GRASP algorithm for solving large-scale single row facility layout problems
- The checkpoint ordering problem
- Decorous combinatorial lower bounds for row layout problems
- New exact approaches to row layout problems
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
- A semidefinite approach for the single row facility layout problem
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- A semidefinite optimization approach to the target visitation problem
- Construction heuristics for the single row layout problem with machine-spanning clearances
- Fast local search for single row facility layout
- Single row layout models
- Insertion based Lin-Kernighan heuristic for single row facility layout
- Semidefinite relaxations of ordering problems
- A polyhedral approach to the single row facility layout problem
- Improved exact approaches for row layout problems with departments of equal length
- Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
- A polyhedral study of triplet formulation for single row facility layout problem
- Solution approaches for the double-row equidistant facility layout problem
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- A new lower bound for the single row facility layout problem
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
- A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics
- Fast simulated annealing for single-row equidistant facility layout
- 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
- A linear ordering problem with weighted rank
- An efficient tabu algorithm for the single row facility layout problem
- An efficient genetic algorithm for single row facility layout
- The constrained single-row facility layout problem with repairing mechanisms
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
Uses Software
This page was built for publication: A computational study and survey of methods for the single-row facility layout problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354626)
