arXiv (OAI)
open access
On the integrality gap of convex mixed-integer programs
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
- Value Functions of Separable Convex Integer Programs are Periodically Convex#1061739
- An infeasible interior-point algorithm for solving primal and dual geometric programs#429971
- Decomposition of Sparse Integer Programs via Nonlinear Edge Encodings and Column-and-Row Generation#972716
- Integer Programming and Combinatorial Optimization#3580
- NP-hardness of ideal lattice problems#1109858
Record · ID 149208
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