A computational study and survey of methods for the single-row facility layout problem
From MaRDI portal
Publication:354626
DOI10.1007/s10589-012-9505-8zbMath1272.90070MaRDI QIDQ354626
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
Related Items
Construction heuristics for the single row layout problem with machine-spanning clearances, 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, 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, New semidefinite programming relaxations for the linear ordering and the traveling salesman problem, A semidefinite optimization approach to the target visitation problem, A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation, 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, Fast simulated annealing for single-row equidistant facility layout, A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics, A GRASP algorithm for solving large-scale single row facility layout problems, Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions, The single row facility layout problem: state of the art, Mathematical optimization approach for facility layout on several rows, Exact approaches for the combined cell layout problem, 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, Simulated annealing and tabu search approaches for the Corridor Allocation Problem, New exact approaches to row layout problems, An efficient genetic algorithm for single row facility layout, Solution Approaches for the Double-Row Equidistant Facility Layout Problem
Uses Software
Cites Work
- Unnamed Item
- Semidefinite relaxations of ordering problems
- A polyhedral approach to the single row 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
- Efficient models for the facility layout problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Methods for the one-dimensional space allocation problem
- A new lower bound for the single row facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Some simplified NP-complete graph problems
- A heuristic procedure for the single-row facility layout problem
- The cut polytope and the Boolean quadric polytope
- 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
- 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
- Global Approaches for Facility Layout and VLSI Floorplanning
- Exact Algorithms for the Quadratic Linear Ordering Problem
- 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
- On the One-Dimensional Space Allocation Problem
- Cones of Matrices and Set-Functions and 0–1 Optimization
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On the cut polytope
- An SDP Approach to Multi-level Crossing Minimization
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Finite-State Processes and Dynamic Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
- An r-Dimensional Quadratic Placement Algorithm
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Geometry of cuts and metrics
