- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes Constrained Graph Diffusion (CGD) for mixed-integer optimization. The main idea is to use a diffusion model to predict integer variables and then solve the remaining continuous problem with a numerical solver. To improve feasibility, the authors introduce constraint correction during the diffusion process. The authors test their method on AC-OPF with branch switching and portfolio optimization. The experiments show improvements in solution quality and feasibility compared with several learning-based baselines, as well as significant speedups over Gurobi.
Critical strengths
Good experimental results: The authors test the method on two different optimization problems. The results show good improvements in solution quality and feasibility. The ablation study also shows the benefit of applying constraint correction during the diffusion process.
Critical weaknesses
-
Missing recent baselines: This paper does not compare with some recent methods, such as [1] and [2]. Especially, the latter also predicts integer variables first and then solves the continuous problem. I think these papers are closely related to this work, and the authors should compare with them or explain why they are not included.
-
Limitation of the proposed method: I have some concerns about the proposed framework. The authors first predict the integer variables and then solve the continuous problem. However, even if the continuous problem is solved exactly, the final solution is not guaranteed to be optimal for the original mixed-integer problem. Once the integer variables are fixed, there is no way to update them based on the continuous optimization results. I think this is a fundamental limitation of this framework, especially when the integer and continuous variables are strongly coupled.
-
Potential issue in the AC-OPF formulation: In Appendix F.1, constraint (47c) is written as
When , this constraint forces the phase angle difference to be zero, even though the corresponding line is disconnected. I think this is incorrect, since the phase angle constraint should be relaxed when the line is disconnected. If this constraint is also used in the implementation, it may change the feasible region of the original problem and affect the experimental results. The authors should clarify this issue.
Reference: [1] FMIP: Joint Continuous-Integer Flow For Mixed-Integer Linear Programming, ICLR 2026 [2] Unsupervised Neural Langevin Sampler for Mixed Integer Linear Programming, ICML 2026
Questions for authors
Please see "Critical Weakness".
4 comments
Authors' comment
Thank you again for your review. We wanted to follow up on our clarification of CGD’s relationship to FMIP and the Unsupervised Neural Langevin Sampler, and how our constraint corrections account for discrete–continuous coupling without guaranteeing global optimality. We also restored the big-M relaxation in Eq. (47c) and clarified that our implementation already relaxed the phase-angle constraint for disconnected lines, so the reported results are unaffected. Please let us know if any part of our explanation or the corrected formulation needs further clarification. If these responses address your concerns, we would appreciate it if you would reconsider your rating in light of the revised manuscript.
Thank you for your clarification. I will increase my score to 3 and maintain my highest confidence score.
Thank you very much!
Authors' response
We thank the reviewer for the helpful review and, in particular, for acknowledging the quality of the results produced by the proposed method, the importance of the ablation study and the clarity of the presentation. Below, we address the reviewer's concern.
Weaknesses.
Response. We thank the reviewer for highlighting these recent works. However, both FMIP [1] and the Unsupervised Neural Langevin Sampler [2] are specifically designed for mixed-integer linear programming (MILP). FMIP [1] uses objective and feasibility guidance from the linear formulation during flow matching. The Langeving Sampler [2] learns the integer decisions through Langevin dynamics and recovers the continuous variables with a linear program.
CGD instead addresses a more general class of mixed-integer optimization problems, including nonconvex MINLPs. AC-OTS involves nonlinear, nonconvex constraints, and fixing the binary transmission-switching decisions leaves a nonconvex problem. The portfolio benchmark also has quadratic objectives and constraints. Applying either method would require substantial effort adapting its formulation and constraint-handling mechanisms to accommodate nonlinear optimization.
We therefore focus our experimental comparisons on methods that can be applied to the considered benchmarks, including DIFUSCO, learning-based prediction baselines, and controlled ablations isolating the contribution of constraint-aware diffusion. We have included these two references in the related-work discussion to clarify the distinctions and acknowledge their contributions.
Response. On the optimality and coupling of discrete and continuous decisions. We agree that fixing the discrete decisions and subsequently optimizing the continuous variables does not guarantee global optimality for the original mixed-integer problem, nor do we make such a claim. Finding and certifying a global optimum for a nonconvex MIP can be computationally prohibitive, which motivates our focus on efficiently high-quality solutions.
CGD accounts for the coupling between discrete and continuous decisions before fixing a discrete assignment. In AC-OTS, the augmented-Lagrangian correction uses the nonlinear AC constraints and their gradients with respect to the relaxed switching decisions, to refine the discrete network topology during reverse diffusion. Our experiments show that CGD achieves low objective gaps, high observed downstream feasibility while substantially reducing solve times.
Response. The reviewer is correct. As written, the phase-angle constraint in Eq. (47c), enforces a zero phase-angle difference when a transmission line is disconnected. We corrected the equation of the AC-OTS formulation in the revised manuscript by restoring the big-M relaxation, analogous to the already correct DC-OTS formulation in Appendix F.3. Our implementation already relaxes the phase-angle constraint when the corresponding line is disconnected, so the feasible set used in the experiments and the reported results are unaffected.
[1] Hongpei Li, Hui Yuan, Han Zhang, Jianghao Lin, Dongdong Ge, Mengdi Wang, and Yinyu Ye. “FMIP: Joint Continuous-Integer Flow For Mixed-Integer Linear Programming.” ICLR, 2026.
[2] Yixin Huang, Shengyu Feng, and Yiming Yang. “Unsupervised Neural Langevin Sampler for Mixed Integer Linear Programming.” ICML, 2026.