Research map / Learning theory and algorithms / Combinatorial and search optimization
RL-SPH: Learning to Achieve Feasible Solutions for Integer Linear Programs
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Reinforcement Learning for Integer Programming: Learning to Cut (ICML 2020 · similarity 0.87)
- Learning Large Neighborhood Search Policy for Integer Programming (NeurIPS 2021 · similarity 0.86)
- SORREL: Suboptimal-Demonstration-Guided Reinforcement Learning for Learning to Branch (AAAI 2025 · similarity 0.84)
- SymILO: A Symmetry-Aware Learning Framework for Integer Linear Optimization (NeurIPS 2024 · similarity 0.84)
- Learning to Remove Cuts in Integer Linear Programming (ICML 2024 · similarity 0.83)
- Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates (AAAI 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.