arXiv (All)
open access
Constrained Graph Diffusion for Mixed Integer Optimization
This paper proposes a novel learning-based approach to approximately solve instances of mixed-integer optimization problems. These problems are computationally challenging, as they require jointly determining discrete and continuous decisions while satisfying complex combinatorial constraints. probl
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 Intersection Cutting Plane Algorithm for Chance-Constrained Programs with Finite Support#1119019
- From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message Passing#1188420
- From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message Passing#1181622
- Extended Formulations in Mixed-Integer Convex Programming#364420
- Partitioning based algorithms for some colouring problems#823225
Record · ID 1202193
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