53 citations · 292 across the 29 of their papers we have counts for
7 papers · 1 filter
Mixed-integer convex representability
Miles Lubin, Ilias Zadik, Juan Pablo Vielma
We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characte…
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…
Polyhedral approximation in mixed-integer convex optimization
Miles Lubin, Emre Yamangil, Russell Bent +1
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances i…
Predicting Performance Under Stressful Conditions Using Galvanic Skin Response
Carter Mundell, Juan Pablo Vielma, Tauhid Zaman
The rapid growth of the availability of wearable biosensors has created the opportunity for using biological signals to measure worker performance. An important question is how to…
Picking Winners in Daily Fantasy Sports Using Integer Programming
David Scott Hunter, Juan Pablo Vielma, Tauhid Zaman
We consider the problem of selecting a portfolio of entries of fixed cardinality for contests with top-heavy payoff structures, i.e. most of the winnings go to the top-ranked entri…
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…