Strong mixed-integer formulations for the floor layout problem
Name
1602.07760.pdf
Size
1.91 MB
Format
Adobe PDF
Checksum (MD5)
19bef2eff07eebbb74ec203502682759
Author(s)
Dey, Santanu S.
Huchette, Joey
Vielma, Juan Pablo
Date Issued
July 2017
Journal
INFOR Information Systems and Operational Research
Publisher
University of Toronto Press Inc
Citation
Huchette, Joey et al. “Strong Mixed-Integer Formulations for the Floor Layout Problem.” INFOR: Information Systems and Operational Research 56, 4 (July 2017): 392–433. doi:10.1080/03155986.2017.1346916. © 2017 The Author(s)
Version
Original manuscript
Abstract
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 remains extremely challenging from a computational perspective. This work takes a systematic approach to constructing MIP formulations and valid inequalities for the FLP that unifies and recovers all known formulations for it. In addition, the approach yields new formulations that can provide a significant computational advantage and can solve previously unsolved instances. While the construction approach focuses on the FLP, it also exemplifies generic formulation techniques that should prove useful for
broader classes of problems.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1080/03155986.2017.1346916
