Enhancing cut selection through reinforcement learning
From MaRDI portal
Recommendations
Cites work
- A machine learning-based approximation of strong branching
- An Automatic Method of Solving Discrete Programming Problems
- An implementation of exact knapsack separation
- Cutting planes in integer and mixed integer programming
- Edmonds polytopes and a hierarchy of combinatorial problems
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Generative deep learning for decision making in gas networks
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- Integer Programming
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Mixed integer programming: analyzing 12 years of progress
- Modeling languages in mathematical optimization.
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Theoretical challenges towards cutting-plane selection
Cited in
(3)
This page was built for publication: Enhancing cut selection through reinforcement learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564771)