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...
Main Authors: | Dey, Santanu S., Huchette, Joey, Vielma, Juan Pablo |
---|---|
Other Authors: | Massachusetts Institute of Technology. Operations Research Center |
Format: | Article |
Published: |
University of Toronto Press Inc
2019
|
Online Access: | http://hdl.handle.net/1721.1/121061 https://orcid.org/0000-0003-4335-7248 |
Similar Items
-
Beating the SDP bound for the floor layout problem: A simple combinatorial idea
by: Dey, Santanu S., et al.
Published: (2019) -
Strong mixed-integer programming formulations for trained neural networks
by: Anderson, Ross, et al.
Published: (2021) -
Extended formulations in mixed integer conic quadratic programming
by: Dunning, Iain Robert, et al.
Published: (2018) -
Mixed Integer Linear Programming Formulation Techniques
by: Vielma, Juan Pablo
Published: (2015) -
Incremental and encoding formulations for Mixed Integer Programming
by: Yıldız, Sercan, et al.
Published: (2017)