Strong mixed-integer formulations for the floor layout problem

Strong mixed-integer formulations for the floor layout problem

The floor layout problem (FLP) tasks a designer with positioning a collection of rectangular boxes on a fixed floor in such a way that minimizes total communication costs between the components. While several mixed integer programming (MIP) formulations for this problem have been developed, it remai...

Volledige beschrijving

Bibliografische gegevens
Hoofdauteurs:	Dey, Santanu S., Huchette, Joey, Vielma, Juan Pablo
Andere auteurs:	Massachusetts Institute of Technology. Operations Research Center
Formaat:	Artikel
Gepubliceerd in:	University of Toronto Press Inc 2019
Online toegang:	http://hdl.handle.net/1721.1/121061 https://orcid.org/0000-0003-4335-7248

Gelijkaardige items

Beating the SDP bound for the floor layout problem: A simple combinatorial idea
door: Dey, Santanu S., et al.
Gepubliceerd in: (2019)

Strong mixed-integer programming formulations for trained neural networks
door: Anderson, Ross, et al.
Gepubliceerd in: (2021)

Extended formulations in mixed integer conic quadratic programming
door: Dunning, Iain Robert, et al.
Gepubliceerd in: (2018)

Mixed Integer Linear Programming Formulation Techniques
door: Vielma, Juan Pablo
Gepubliceerd in: (2015)

Incremental and encoding formulations for Mixed Integer Programming
door: Yıldız, Sercan, et al.
Gepubliceerd in: (2017)

Extended Formulations in Mixed-Integer Convex Programming
door: Yamangil, Emre, et al.
Gepubliceerd in: (2019)

Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming
door: Modaresi, Sina, et al.
Gepubliceerd in: (2018)

Advanced mixed-integer programming formulations : methodology, computation, and application
door: Huchette, Joseph Andrew
Gepubliceerd in: (2018)

Mixed-Integer Convex Representability
door: Lubin, Miles C, et al.
Gepubliceerd in: (2019)

Disjunctive cuts in Mixed-Integer Conic Optimization
door: Lodi, Andrea, et al.
Gepubliceerd in: (2023)

Small and strong formulations for unions of convex sets from the Cayley embedding
door: Vielma Centeno, Juan Pablo
Gepubliceerd in: (2019)

Shapes and recession cones in mixed-integer convex representability
door: Zadik, Ilias, et al.
Gepubliceerd in: (2024)

Outer approximation with conic certificates for mixed-integer convex problems
door: Coey, Chris, et al.
Gepubliceerd in: (2021)

Polyhedral approximation in mixed-integer convex optimization
door: Yamangil, Emre, et al.
Gepubliceerd in: (2018)

On the Chvátal–Gomory closure of a compact convex set
door: Dadush, Daniel, et al.
Gepubliceerd in: (2015)

On the Chvátal–Gomory closure of a compact convex set
door: Dadush, Daniel, et al.
Gepubliceerd in: (2019)

Embedding Formulations and Complexity for Unions of Polyhedra
door: Vielma Centeno, Juan Pablo
Gepubliceerd in: (2019)

Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
door: Modaresi, Sina, et al.
Gepubliceerd in: (2016)

Integer programming formulation for convoy movement problem
door: Kumar, P. N. Ram., et al.
Gepubliceerd in: (2009)

Mixed integer formulation for integration of lot sizing and lot streaming problem with scheduled preventive maintenance
door: Mortezaei, Navid, et al.
Gepubliceerd in: (2014)

Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA
door: Dey, Santanu S, et al.
Gepubliceerd in: (2022)

Behaviour of flat plate floor system with irregular column layout
door: Tan, Halim Nyonata.
Gepubliceerd in: (2008)

Shear Wall Layout Optimization in Coordination with Architectural Floor Plans
door: Philps, Davis Sebastian
Gepubliceerd in: (2022)

Designing the re-layout of the production floor using integrated systematic layout planning (SLP) and simulation methods
door: Masriah, Mansur, et al.
Gepubliceerd in: (2020)

Nonhomogeneous Time Mixed Integer Linear Programming Formulation for Traffic Signal Control
door: Guilliard, Iain, et al.
Gepubliceerd in: (2018)

Relaxation methods for pure and mixed integer programming problems
door: Gorry, George Anthony, et al.
Gepubliceerd in: (2009)

Strong Formulations for Network Design Problems with Connectivity Requirements
door: Magnanti, Thomas L., et al.
Gepubliceerd in: (2004)

A hybrid ant colony algorithm for solving facility layout problems formulated as quadratic assignment problems
door: See, Phen Chiak
Gepubliceerd in: (2008)

On the time transformation of mixed integer optimal control problems using a consistent fixed integer control function
door: Ringkamp, M, et al.
Gepubliceerd in: (2016)

A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints
door: Bertsimas, Dimitris, et al.
Gepubliceerd in: (2022)

A Mixed Integer Linear Programming Problem Which is Efficiently Solvable
door: Leiserson, Charles E., et al.
Gepubliceerd in: (2023)

Relaxation and exact algorithms for solving mixed integer-quadratic optimization problems
door: Tziligakis, Constantine Nikolaos
Gepubliceerd in: (2005)

LaLaLoc++: global floor plan comprehension for layout localisation in unvisited environments
door: Howard-Jenkins, H, et al.
Gepubliceerd in: (2022)

Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review
door: See, Phen Chiak, et al.
Gepubliceerd in: (2008)

Production system improvement at a medical devices company : floor layout reduction and manpower analysis
door: AlEisa, Abdulaziz A. (Abdulaziz Asaad)
Gepubliceerd in: (2013)

Online Mixed-Integer Optimization in Milliseconds
door: Bertsimas, Dimitris, et al.
Gepubliceerd in: (2022)

Mixed time finite element formulations for dynamic problems
door: Sheng, Gang.
Gepubliceerd in: (2009)

On Retiming Synchronous Circuitry and Mixed-integer Optimization
door: Papaefthymiou, Marios Christos
Gepubliceerd in: (2023)

Portfolio construction through mixed integer programming
Gepubliceerd in: (2003)

Turnpike theorems for integer programming problems,
door: Shapiro, Jeremy F.
Gepubliceerd in: (2009)