3 papers
cs.LG2025
Automated Proof of Polynomial Inequalities via Reinforcement Learning
Banglong Liu, Niuniu Qi, Xia Zeng +2
Polynomial inequality proving is fundamental to many mathematical disciplines and finds wide applications in diverse fields. Current traditional algebraic methods are based on sear…
cs.AI2024
A Context-Enhanced Framework for Sequential Graph Reasoning
Shuo Shi, Chao Peng, Chenyang Xu +1
The paper studies sequential reasoning over graph-structured data, which stands as a fundamental task in various trending fields like automated math problem solving and neural grap…
math.OC2024
Learning to Select Cutting Planes in Mixed Integer Linear Programming Solving
Xuefeng Zhang, Liangyu Chen, Zhengfeng Yang +1
Cutting planes (cuts) are crucial for solving Mixed Integer Linear Programming (MILP) problems. Advanced MILP solvers typically rely on manually designed heuristic algorithms for c…