MIT Open Scholarship
metadata only
Extended Formulations in Mixed-Integer Convex Programming
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
- Sparse Cuts for the Positive Semidefinite Cone#793594
- Sparse Cuts for the Positive Semidefinite Cone#789590
- Constraint aggregation principle in convex optimization#429980
- Strong Duality in Risk-Constrained Nonconvex Functional Programming#1014439
Record · ID 364420
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