Beating the SDP bound for the floor layout problem: A simple combinatorial idea
For many mixed-integer programming (MIP) problems, high-quality dual bounds can be obtained either through advanced formulation techniques coupled with a state-of-the-art MIP solver, or through semi-definite programming (SDP) relaxation hierarchies. In this paper, we introduce an alternative boundin...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Toronto Press Inc,
2019-03-22T18:40:46Z.
|
| Subjects: | |
| Online Access: | Get fulltext |