A polyhedral approach to the single row facility layout problem
From MaRDI portal
Recommendations
- The single row facility layout problem: state of the art
- A computational study and survey of methods for the single-row facility layout problem
- A new lower bound for the single row facility layout problem
- A polyhedral study of triplet formulation for single row facility layout problem
- On the exact solution of a facility layout problem
Cites work
- A branch and bound algorithm for maximum likelihood paired comparison ranking
- A computational study and survey of methods for the single-row facility layout problem
- A new lower bound for the single row facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- An Exact Approach to the One-Dimensional Facility Layout Problem
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Decorous lower bounds for minimum linear arrangement
- Efficient models for the facility layout problem
- Fifty-plus years of combinatorial integer programming
- Finite-State Processes and Dynamic Programming
- Generating lower bounds for the linear arrangement problem
- Geometric algorithms and combinatorial optimization
- Geometry of cuts and metrics
- Global approaches for facility layout and VLSI floorplanning
- Minimum cuts and related problems
- Multidimensional scaling. I: Theory and method
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- On the Facial Structure of the Set of Correlation Matrices
- On the One-Dimensional Space Allocation Problem
- On the exact solution of a facility layout problem
- One-Dimensional Space Allocation: An Ordering Algorithm
- Polyhedral approaches to mixed integer linear programming
- Provably near-optimal solutions for very large single-row facility layout problems
- Single row facility layout problem using a permutation-based genetic algorithm
- Some simplified NP-complete graph problems
- Stronger linear programming relaxations of max-cut
Cited in
(33)- Semidefinite relaxations of ordering problems
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- An improved mixed-integer programming model for the double row layout of facilities
- Strong mixed-integer formulations for the floor layout problem
- On the exact solution of a facility layout problem
- An efficient tabu algorithm for the single row facility layout problem
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
- A new lower bound for the single 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
- Construction heuristics for the single row layout problem with machine-spanning clearances
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- Single row facility layout problem using a permutation-based genetic algorithm
- Optimal solutions for the double row layout problem
- The single row facility layout problem: state of the art
- New exact approaches to row layout problems
- Optimal linear arrangements using betweenness variables
- Decorous combinatorial lower bounds for row layout problems
- See the light: Optimization of put‐to‐light order picking systems
- Fast local search for single row facility layout
- Single row layout models
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- A polyhedral study of triplet formulation for single row facility layout problem
- A GRASP algorithm for solving large-scale single row facility layout problems
- Exact approaches for the combined cell layout problem
- A parallel ordering problem in facilities layout
- An efficient genetic algorithm for single row facility 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
This page was built for publication: A polyhedral approach to 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 Q378107)
