1 citations · 1 across the 4 of their papers we have counts for
5 papers
Hard Instances on Demand
Jamie Fravel, Martin Koutecký, Pavlo Tsitsei
The conclusions of an experimental study of algorithms are only as good as the instances they are run on. Benchmark libraries for well-studied problems took decades to curate, whil…
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing
Jamie Fravel, Robert Hildebrand
An integer program is called ideal if its continuous relaxation coincides with its convex hull allowing the problem to be solved as a continuous program and offering substantial co…
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing
Jamie Fravel, Robert Hildebrand
We develop an optimization framework for identifying ideal Mixed Binary Linear Programs (MBLP) which is linear when using known input data and nonconvex quadratic over parametric i…
Optimizing Representation in Redistricting: Dual Bounds for Partitioning Problems with Non-Convex Objectives
Jamie Fravel, Robert Hildebrand, Nicholas Goedert +2
We investigate optimization models for the purpose of computational redistricting. Our focus is on nonconvex objectives for estimating expected Black Representatives and Political…
Continuous Equality Knapsack with Probit-Style Objectives
Jamie Fravel, Robert Hildebrand, Laurel Travis
We study continuous, equality knapsack problems with uniform separable, non-convex objective functions that are continuous, antisymmetric about a point, and have concave and convex…