arXiv (All)
open access
Set System Approximation for Binary Integer Programs: Reformulations and Applications
Covering and elimination inequalities are central to combinatorial optimization, yet their role has largely been studied in problem-specific settings or via no-good cuts. This paper introduces a unified perspective that treats these inequalities as primitives for set system approximation in binary i
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
- The Minimum-Weight Mixed Dominating Set on Threshold Graphs#924639
- Extremal Families for the Erdős--Kleitman Problem: The Missing Constructions#800116
- Using criticalities as a heuristic for answer set programming#82519
- A Near-Optimal Linear Range for the Erdős Matching Conjecture#985218
- Sensitivity and Block Sensitivity of Elementary Symmetric Boolean Functions of Arbitrary Degree#1049516
Record · ID 1062808
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