Integer quadratic programming in the plane
From MaRDI portal
Publication:5384023
DOI10.1137/1.9781611973402.62zbMath1423.90166OpenAlexW4233251342WikidataQ57568110 ScholiaQ57568110MaRDI QIDQ5384023
Alberto Del Pia, Robert Weismantel
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1b0b307649dfe29d22949d6d893268336a1464bf
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Quadratic programming (90C20)
Related Items
Proximity in concave integer quadratic programming ⋮ Short Presburger Arithmetic Is Hard ⋮ Complexity of optimizing over the integers ⋮ An approximation algorithm for indefinite mixed integer quadratic programming ⋮ Mixed-integer quadratic programming is in NP ⋮ A Polyhedral Frobenius Theorem with Applications to Integer Optimization
