Metraipolis › archive › dc_a23bc271d85c

Constrained Graph Diffusion for Mixed Integer Optimization — arXiv:2608.13079

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.13079
License (as archived)
CC0-1.0
Archived
2026-10-19T04:27:33.677Z
SHA-256 of the archived text
a4f7409434860fbdc637ae50e817222c3eee371111bb25b4c0b56a6cca63b896
Stable URL of this page
https://metraipolis.com/documento/dc_a23bc271d85c

How to cite

Constrained Graph Diffusion for Mixed Integer Optimization — arXiv:2608.13079 — arXiv (en), https://arxiv.org/abs/2608.13079 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a23bc271d85c (Metraipolis archive dc_a23bc271d85c, sha256 a4f7409434860fbdc637ae50e817222c3eee371111bb25b4c0b56a6cca63b896)
BibTeX
@misc{dca23bc271d85c,
  title = {Constrained Graph Diffusion for Mixed Integer Optimization — arXiv:2608.13079},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13079},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a23bc271d85c; sha256 a4f7409434860fbdc637ae50e817222c3eee371111bb25b4c0b56a6cca63b896},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13079. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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. problem-agnostic and can accommodate a broad class of mixed-integer optimization problems through suitable projection operators. We introduce Constrained Graph Diffusion (CGD), a learning-based framework that approximately solves recurring instances of such problems by learning a conditional distribution over their discrete decisions. CGD uses a graph-based diffusion model and incorporates constraint information directly into the reverse diffusion process, steering intermediate predictions toward the feasible region throughout generation. By operating on continuous relaxations of the discrete variables, CGD defines a differentiable constrained generation pathway up to terminal discrete recovery. Once the discrete decision is recovered and fixed, a numerical optimizer solves the remaining continuous problem, avoiding online combinatorial search over the binary variables while retaining numerical optimization for continuous completion. We evaluate CGD on AC-OPF with branch switching and discrete portfolio optimization, demonstrating substantial improvements in feasibility and solution quality over learning-based baselines while achieving speedups of up to $543\times$ over state-of-the-art MIP solvers on large instances.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-14 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.13079 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T04:20:35.846Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).