Strong mixed-integer formulations for the floor layout problem
From MaRDI portal
Publication:5882271
DOI10.1080/03155986.2017.1346916OpenAlexW2963494043MaRDI QIDQ5882271FDOQ5882271
Authors: Joey Huchette, J. P. Vielma, Santanu S. Dey 
Publication date: 15 March 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.07760
Recommendations
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- Strong formulations for mixed integer programming: A survey
- scientific article; zbMATH DE number 510756
- An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems
- Strong formulations for mixed integer programs: valid inequalities and extended formulations
- Integer programming approaches to facilities layout models with forbidden areas
- Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
- A geometric way to build strong mixed-integer programming formulations
- Computing and Combinatorics
- Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem
Cites Work
- Second-order cone programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Modelling with integer variables
- A Survey of Combinatorial Gray Codes
- A new lower bound for the single row facility layout problem
- A nonlinear optimization approach for solving facility layout problems
- Optimal facility layout design
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- Applying the sequence-pair representation to optimal facility layout designs
- On the exact solution of a facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- 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
- Enhanced Model Formulations for Optimal Facility Layout
- A polyhedral approach to the single row facility layout problem
- A nonlinear optimization methodology for VLSI fixed-outline floorplanning
- A convex optimisation framework for the unequal-areas facility layout problem
- A new mathematical-programming framework for facility-layout design
- Computing in operations research using Julia
- A new simulated annealing algorithm for the facility layout problem
- Mixed integer linear programming formulation techniques
- An Improvement-Type Layout Algorithm for Single and Multiple-Floor Facilities
Cited In (3)
- An efficient algorithm for unequal area facilities layout planning with input and output points
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem
Uses Software
This page was built for publication: Strong mixed-integer formulations for the floor layout problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882271)
