1 citations · 1 across the 3 of their papers we have counts for
5 papers
Curvature batching gives single-exponential integer quadratic programming
Cinar Ari, Robert Hildebrand
Integer Quadratic Programming (IQP), , is a fundamental problem in combinatorial optimization. While the convex and concave special…
Optimal triangulations for piecewise linear approximations of non-convex variable products
Robert Burlacu, Lukas Hager, Robert Hildebrand
We show optimal triangulations for piecewise linear (PWL) approximations of indefinite quadratic functions over the plane. Optimal triangulations have minimum triangle density whil…
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…
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. IV. The General Unimodular Two-Dimensional Case
Robert Hildebrand, Matthias Köppe, Luze Xu
We study an abstract setting for cutting planes for integer programming called the infinite group problem. In this abstraction, cutting planes are computed via cut generating funct…
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…