HAL (France)
open access
Integer programming on domains containing inseparable ordered pairs
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
- GRET: Graph-Refined Joint Triple Extraction for Overlapping Triples#381305
- Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families#781144
- Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families#779769
- Integer Programming and Combinatorial Optimization#3580
- Large smooth twins from short lattice vectors#1014546
Record · ID 658859
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