Strong mixed-integer formulations for the floor layout problem

DOI10.1080/03155986.2017.1346916MaRDI QIDQ5882271zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

integer programminglayout

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80)

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

• A Survey of Combinatorial Gray Codes
• A convex optimisation framework for the unequal-areas facility layout problem
• A new lower bound for the single row facility layout problem
• A new mathematical-programming framework for facility-layout design
• A new simulated annealing algorithm for the facility layout problem
• 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
• An Improvement-Type Layout Algorithm for Single and Multiple-Floor Facilities
• An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
• Applying the sequence-pair representation to optimal facility layout designs
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
• Computing in operations research using Julia
• Disjunctive programming: Properties of the convex hull of feasible points
• Enhanced Model Formulations for Optimal Facility Layout
• Mixed integer linear programming formulation techniques
• Modelling with integer variables
• On the exact solution of a facility layout problem
• Optimal facility layout design
• Provably near-optimal solutions for very large single-row facility layout problems
• Second-order cone programming

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

Describes a project that uses

Uses Software

• UFO
• JuMP
• Julia

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)