- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This maniscript introduces MAESTRO, a hierarchical reinforcement learning framework designed to orchestrate branch-and-cut solvers by coordinating when to branch, add cuts, or prune cuts. The framework adopts a Manager–Worker architecture over shared bipartite GNN embeddings, where the Manager selects strategic meta-actions and the Worker performs context-aware cut selection. Evaluated primarily on Set Cover alongside three transfer benchmarks, MAESTRO demonstrates significant memory reductions while achieving competitive solve times and rates compared to default SCIP and an RL cut-selection baseline
Critical strengths
The maniscript addresses a relevant challenge in combinatorial optimization by jointly orchestrating branching, cut selection, and cut pruning within a unified learning framework rather than treating them in isolation. The reported memory reductions (29–40× compared to default SCIP) are practically meaningful for resource-constrained deployments.
Critical weaknesses
The empirical evaluation is limited in both baseline coverage and benchmark diversity. Beyond default SCIP, the paper compares against only a single machine learning baseline (MIRACLE) on Set Cover, overlooking well-established learning-to-branch and learning-to-cut methods in the literature. Furthermore, the evaluated datasets are narrow: the main experiments rely almost entirely on Set Cover instances, making the empirical results unconvincing.
The appendix contains numerous formatting and completeness issues, including multiple empty section headings without any explanatory text (e.g., A.3.1–A.3.3, A.5.1–A.5.3, A.10.1–A.10.2), as well as datasets mentioned without corresponding experimental results (e.g., MIPLIB in A.7.2). These omissions indicate that the submission is far from ready. Overall, this manuscript appears incomplete, and I strongly recommend that the authors thoroughly polish and finalize the paper prior to submitting it to another conference.
Questions for authors
-
Could you provide the offline training overhead for the full three-phase curriculum and compare these offline costs against MIRACLE and other learning-based baselines?
-
Could you report training dynamic curves to demonstrate learning stability?
-
The proposed approach appears heavily engineering-driven with multiple heuristics and reward-tuning tricks, while lacking deeper algorithmic insights. It does not provide sufficient analysis to explain the mechanism behind the results in Table 2. Providing concrete insights may help readers understand the true effectiveness of the method.