A polyhedral approach to the single row facility layout problem
From MaRDI portal
Publication:378107
DOI10.1007/s10107-012-0533-zzbMath1280.90132WikidataQ57702149 ScholiaQ57702149MaRDI QIDQ378107
André R. S. Amaral, Adam N. Letchford
Publication date: 11 November 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0533-z
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
Related Items
Strong mixed-integer formulations for the floor layout problem, Beating the SDP bound for the floor layout problem: a simple combinatorial idea, Construction heuristics for the single row layout problem with machine-spanning clearances, See the light: Optimization of put‐to‐light order picking systems, 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, The corridor allocation problem, A computational study and survey of methods for the single-row facility layout problem, Semidefinite relaxations of ordering problems, Single row facility layout problem using a permutation-based genetic algorithm, A new lower bound for the single row facility layout problem, An improved mixed-integer programming model for the double row layout of facilities, 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, Optimal linear arrangements using betweenness variables, Optimal solutions for the double row layout problem, The single row facility layout problem: state of the art, 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, New exact approaches to row layout problems, An efficient genetic algorithm for single row facility layout
Cites Work
- A computational study and survey of methods for the single-row facility layout problem
- Single row facility layout problem using a permutation-based genetic algorithm
- Efficient models for the facility layout problem
- A new lower bound for the single row facility layout problem
- Geometric algorithms and combinatorial optimization
- Some simplified NP-complete graph problems
- Stronger linear programming relaxations of max-cut
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- Generating lower bounds for the linear arrangement problem
- On the exact solution of a facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Multidimensional scaling. I: Theory and method
- Global Approaches for Facility Layout and VLSI Floorplanning
- Decorous Lower Bounds for Minimum Linear Arrangement
- 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
- Polyhedral Approaches to Mixed Integer Linear Programming
- Fifty-Plus Years of Combinatorial Integer Programming
- On the One-Dimensional Space Allocation Problem
- Minimum cuts and related problems
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- On the Facial Structure of the Set of Correlation Matrices
- Finite-State Processes and Dynamic Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
- A branch and bound algorithm for maximum likelihood paired comparison ranking
- Geometry of cuts and metrics
