Does anyone know a reference to the answer if unconstrained integer convex optimization problem (i.e. $\min_{x\in \mathbb{Z}^N} F(x)$, $F$ is convex and $N$ is NOT fixed) is NP-hard?
Thank you in advance.
Is unconstrained integer convex optimization problem NP-hard?
Vahan
- 19
- 3