Beating the SDP bound for the floor layout problem: a simple combinatorial idea
From MaRDI portal
Publication:5882276
Recommendations
- Strong mixed-integer formulations for the floor layout problem
- Semidefinite and Lagrangian relaxations for hard combinatorial problems
- Provably near-optimal solutions for very large single-row facility layout problems
- Bounds for the quadratic assignment problem using the bundle method
- Strong and compact relaxations in the original space using a compact extended formulation
Cites work
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A convex optimisation framework for the unequal-areas facility layout problem
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A new lower bound for the single row facility layout problem
- A new mathematical-programming framework for facility-layout design
- A nonlinear optimization approach for solving facility layout problems
- A nonlinear optimization methodology for VLSI fixed-outline floorplanning
- A polyhedral approach to 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
- Applying the sequence-pair representation to optimal facility layout designs
- Approximating polyhedra with sparse inequalities
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Cutting planes in integer and mixed integer programming
- Enhanced Model Formulations for Optimal Facility Layout
- Global optimization with polynomials and the problem of moments
- Integer Programming
- Mixed integer linear programming formulation techniques
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- On the exact solution of a facility layout problem
- Optimal facility layout design
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Provably near-optimal solutions for very large single-row facility layout problems
- Semidefinite programming and integer programming
- Some lower bounds on sparse outer approximations of polytopes
- Sparsity of lift-and-project cutting planes
- Strong mixed-integer formulations for the floor layout problem
- The group-theoretic approach in mixed integer programming
Cited in
(2)
This page was built for publication: Beating the SDP bound for the floor layout problem: a simple combinatorial idea
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882276)
