Enhancing cut selection through reinforcement learning

DOI10.1007/s11425-023-2294-3MaRDI QIDQ6564771

Lingfeng Niu, Liang Chen, Yu-Hong Dai, Shengchao Wang

Publication date: 1 July 2024

Published in: Science China. Mathematics (Search for Journal in Brave)

zbMATH Keywords

reinforcement learningcutting plane methodmixed integer linear programmingcut selection

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Mixed integer programming (90C11)

Cites Work

• Unnamed Item
• An implementation of exact knapsack separation
• Cutting planes in integer and mixed integer programming
• Modeling languages in mathematical optimization.
• Theoretical challenges towards cutting-plane selection
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Generative deep learning for decision making in gas networks
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Edmonds polytopes and a hierarchy of combinatorial problems
• Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
• An Automatic Method of Solving Discrete Programming Problems
• Integer Programming
• Mixed Integer Programming: Analyzing 12 Years of Progress
• A Machine Learning-Based Approximation of Strong Branching

Related Items (1)

Preface

This page was built for publication: Enhancing cut selection through reinforcement learning