arXiv (All)
open access
Approximating the Chvátal--Gomory Closure of Capacity-Bounded Min-Closed Systems
Optimizing over the {0, 1/2} rank-1 Chvàtal-Gomory (CG) closure of a binary integer linear program is NP-hard. While polynomial-time approximation schemes (PTAS) are established for monotone packing and covering formulations, extending these guarantees to mixed-sign variants remains an open challeng
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
- An In-depth Study of LLM Contributions to the Bin Packing Problem#288183
- PrecPack: An Efficient Open-Source Exact Solver for Bin Packing with Generalized Precedence Constraints#1123733
- Set System Approximation for Binary Integer Programs: Reformulations and Applications#1062808
- Bipartite Turán Numbers of Trees and Star Forests#1118674
- Forbidden Subgraphs of Graphs with Low Bandwidth#822364
Record · ID 1130757
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