arXiv (OAI Expanded)
open access
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 t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Convexification of classes of mixed-integer sets with L$^\natural$-convexity#986803
- The Erdős Matching Conjecture for 4-uniform hypergraphs#1070833
- Sharp $p$-adic Extrema and Least Extremal Rows for Restricted Binomial GCDs#1156600
- Revisiting transportation problems under Monge costs with applications to the Discrete Ordered Median Problem#1156280
- Degree Power Sums in Extremal Set Systems#1118672
Record · ID 1099921
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive