← Search

Fangzhou Zhu

7 accepted papers

2026

Opt-Verifier: Unleashing the Power of LLMs for Optimization Modeling via Dual-Side Verification

ICML 2026poster

Building mathematical optimization models is critical in operations research (OR), while it requires substantial human expertise. Recent advancements have utilized large language models (LLMs) to automate this modeling process. However, existing works often struggle to verify the correctness of the …

Cited by 0SourceScholar
2025

Apollo-MILP: An Alternating Prediction-Correction Neural Solving Framework for Mixed-Integer Linear Programming

ICLR 2025poster

Leveraging machine learning (ML) to predict an initial solution for mixed-integer linear programming (MILP) has gained considerable popularity in recent years. These methods predict a solution and fix a subset of variables to reduce the problem dimension. Then, they solve the reduced problem to obta…

Cited by 7SourcePDFScholar
2025

BPP-Search: Enhancing Tree of Thought Reasoning for Mathematical Modeling Problem Solving

ACL 2025long

LLMs exhibit advanced reasoning capabilities, offering the potential to transform natural language questions into mathematical models. However, existing open-source datasets in operations research domain lack detailed annotations of the modeling process, such as variable definitions, focusing solely…

2025

Dynamic Configuration for Cutting Plane Separators via Reinforcement Learning on Incremental Graph

NeurIPS 2025poster

Cutting planes (cuts) are essential for solving mixed-integer linear programming (MILP) problems, as they tighten the feasible solution space and accelerate the solving process. Modern MILP solvers offer diverse cutting plane separators to generate cuts, enabling users to leverage their potential co…

Cited by 0SourceScholar
2024

Rethinking Branching on Exact Combinatorial Optimization Solver: The First Deep Symbolic Discovery Framework

ICLR 2024poster

Machine learning (ML) has been shown to successfully accelerate solving NP-hard combinatorial optimization (CO) problems under the branch and bound framework. However, the high training and inference cost and limited interpretability of ML approaches severely limit their wide application to modern…

Cited by 11SourcePDFScholar
2024

Towards General Algorithm Discovery for Combinatorial Optimization: Learning Symbolic Branching Policy from Bipartite Graph

ICML 2024poster

Machine learning (ML) approaches have been successfully applied to accelerating exact combinatorial optimization (CO) solvers. However, many of them fail to explain what patterns they have learned that accelerate the CO algorithms due to the black-box nature of ML models like neural networks, and th…

Cited by 6SourcePDFScholar