activity
20102026
most citedA new Lenstra-type Algorithm for Quasiconvex Polynomial Integer Minimization with Complexity 2^O(n log n)

38 citations · 129 across the 25 of their papers we have counts for

collaborators
Showing 2026Show all

6 papers · 1 filter

math.OC2026

Computing Equilibria in Integer Programming Games with Shared Constraints

Bainian Hao, Hyunwoo Lee, Robert Hildebrand +1

We develop a cutting-plane algorithm for computing pure Nash equilibria in finite integer games with shared constraints, where a deviation may be feasible against one opponent prof…

math.OC2026

Hidden Convexity via Symmetric Displacement Covers: Mixed-Integer Quadratic Programming and Integer Cubic Programming in Fixed Dimension

Cinar Ari, Robert Hildebrand

We give exact polynomial-time algorithms in fixed dimension for mixed-integer quadratic programming over arbitrary rational polyhedra and for integer cubic programming over bounded…

math.OC2026

Bounded Integer Quadratic Programming through Parallelepiped Covers and Discrete Convic Optimization

Cinar Ari, Robert Hildebrand

We give an exact algorithm for minimizing an arbitrary rational quadratic polynomial over the integer points of a bounded rational polyhedron $\{x : Ax \le b\…

math.OC2026

Integer Maximization over Balls: Hardness and Exact Algorithms

Cinar Ari, Robert Hildebrand

We study the problem of maximizing a linear function over the integer points of an origin-centered ball, which we call \BallIPp{p}. For every fixed integer , we pro…

math.OC2026

Curvature batching for integer and mixed-integer quadratic programming

Cinar Ari, Robert Hildebrand

We give an explicit algorithm for integer quadratic programming with running time , where is the number of variables, bounds the absolute en…

math.OC2026

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…