Research map / Learning theory and algorithms / Combinatorial and search optimization
A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems
Yanli Liu, Chu-Min Li, Hua Jiang, Kun He
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use bound-decrease reward scores to choose branching vertices and matches | McSplit · All instances (21,743) | instances solved: 9,334 -> 9,464 | Improved |
| use bound-decrease reward scores to choose branching vertices and matches | McSplit · Bio | instances solved: 6655 -> 6729 | Improved |
| use bound-decrease reward scores to choose branching vertices and matches | McSplit · Images | instances solved: 1245 -> 1280 | Improved |
| use bound-decrease reward scores to choose branching vertices and matches | McSplit · LV | instances solved: 400 -> 418 | Improved |
| use bound-decrease reward scores to choose branching vertices and matches | McSplit · LargerLV | instances solved: 578 -> 584 | Improved |
| use bound-decrease reward scores to choose branching vertices and matches | McSplit · Scalefree | instances solved: 13 -> 13 | No clear effect |
| use bound-decrease reward scores to choose branching vertices and matches | McSplit · Si | instances solved: 419 -> 416 | Hurt |
| combine the RL branching heuristic with top-down search | McSplit↓ · All instances (21,743) | instances solved: 10,389 -> 10,506 | Improved |
| choose branches using bound-decrease rewards, which diversifies branching beyond high-degree vertices | McSplit · representative instances | time to find optimum | Mixed |
Closest papers by meaning
- Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem (AAAI 2023 · similarity 0.93)
- Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021 · similarity 0.88)
- Planning in Branch-and-Bound: Model-Based Reinforcement Learning for Exact Combinatorial Optimization (AAAI 2026 · similarity 0.88)
- Reinforcement Learning for Branch-and-Bound Optimisation Using Retrospective Trajectories (AAAI 2023 · similarity 0.87)
- Towards General Algorithm Discovery for Combinatorial Optimization: Learning Symbolic Branching Policy from Bipartite Graph (ICML 2024 · similarity 0.86)
- Search Strategy Generation for Branch and Bound Using Genetic Programming (AAAI 2025 · similarity 0.85)
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.
