Cinar Ari

collaborators

2 papers

math.OC2026

Integer Maximization over $ℓ_{p}$ 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 $ℓ_{p}$ ball, which we call \BallIPp{p}. For every fixed integer $p \geq 2$ , we pro…

math.OC2026

Curvature batching gives single-exponential integer quadratic programming

Cinar Ari, Robert Hildebrand

Integer Quadratic Programming (IQP), $min {x^{T} Q x + c^{T} x : A x \leq b, x \in Z^{n}}$ , is a fundamental problem in combinatorial optimization. While the convex and concave special…

Integer Maximization over ℓp​ Balls: Hardness and Exact Algorithms

Curvature batching gives single-exponential integer quadratic programming

Integer Maximization over $ℓ_{p}$ Balls: Hardness and Exact Algorithms