1.3k citations · 1.4k across the 16 of their papers we have counts for
3 papers · 1 filter
A combinatorial approach for small and strong formulations of disjunctive constraints
Joey Huchette, Juan Pablo Vielma
We present a framework for constructing strong mixed-integer programming formulations for logical disjunctive constraints. Our approach is a generalization of the logarithmically-s…
Beating the SDP bound for the floor layout problem: A simple combinatorial idea
Joey Huchette, Santanu S. Dey, Juan Pablo Vielma
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 solve…
Strong mixed-integer formulations for the floor layout problem
Joey Huchette, Santanu S. Dey, Juan Pablo Vielma
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 t…