7 citations · 7 across the 4 of their papers we have counts for
5 papers
Compact mixed-integer programming relaxations in quadratic optimization
Ben Beach, Robert Hildebrand, Joey Huchette
We present a technique for producing valid dual bounds for nonconvex quadratic optimization problems. The approach leverages an elegant piecewise linear approximation for univariat…
An Approximate Method for the Optimization of Long-Horizon Tank Blending and Scheduling Operations
Benjamin Beach, Robert Hildebrand, Kimberly Ellis +1
We address a challenging tank blending and scheduling problem regarding operations for a chemical plant. We model the problem as a nonconvex MIQCP, then approximate this model as a…
A Flexible Job Shop Scheduling Representation of the Autonomous In-Space Assembly Task Assignment Problem
Joshua Moser, Julia Hoffman, Robert Hildebrand +1
As in-space exploration increases, autonomous systems will play a vital role in building the necessary facilities to support exploration. To this end, an autonomous system must be…
Binary Extended Formulations
Sanjeeb Dash, Oktay Gunluk, Robert Hildebrand
We analyze different ways of constructing binary extended formulations of mixed-integer problems with bounded integer variables and compare their relative strength with respect to…
Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets
Amitabh Basu, Robert Hildebrand, Matthias Köppe
We study a mixed integer linear program with m integer variables and k non-negative continuous variables in the form of the relaxation of the corner polyhedron that was introduced…