Integer Maximization over $\ell_p$ Balls: Hardness and Exact Algorithms
We study the problem of maximizing a linear function over the integer points of an origin-centered $\ell_p$ ball, which we call \BallIPp{p}. For every fixed integer $p\ge2$, we prove that the decision problem over an $\ell_p$-ball is NP-complete. We then focus on the Euclidean case and study how the difficulty of the p...