Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
From MaRDI portal
Publication:2901038
Recommendations
- Provably near-optimal solutions for very large single-row facility layout problems
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- A computational study and survey of methods for the single-row facility layout problem
- A semidefinite optimization-based approach for global optimization of multi-row facility layout
- A polyhedral approach to the single row facility layout problem
Cited in
(42)- Exact approaches for the combined cell layout problem
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- An algorithm of global optimization for solving layout problems
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- Mathematical optimization approach for facility layout on several rows
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- Generalized Benders' decomposition for topology optimization problems
- A GRASP algorithm for solving large-scale single row facility layout problems
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Decorous combinatorial lower bounds for row layout problems
- Strong mixed-integer formulations for the floor layout problem
- An improved interior-point cutting-plane method for binary quadratic optimization
- New exact approaches to row layout problems
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- A semidefinite approach for the single row facility layout problem
- A semidefinite optimization-based approach for global optimization of multi-row facility layout
- Fast local search for single row facility layout
- Single row layout models
- Insertion based Lin-Kernighan heuristic for single row facility layout
- 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
- Construction heuristics for the single row layout problem with machine-spanning clearances
- Single row facility layout problem using a permutation-based genetic algorithm
- 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 parallel ordering problem in facilities layout
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
- The corridor allocation problem
- A new lower bound for the single row facility layout problem
- Semidefinite programming and constraint programming
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Global approaches for facility layout and VLSI floorplanning
- The single row facility layout problem: state of the art
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- An efficient tabu algorithm for the single row facility layout problem
- Optimal solutions for the double row 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
This page was built for publication: Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901038)
