Beating the SDP bound for the floor layout problem: a simple combinatorial idea.

Joey Huchette, Santanu S. Dey, Juan Pablo Vielma

Abstract: 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 sem...