Research map / Learning theory and algorithms / Combinatorial and search optimization
Right Branches Matter in Failure-based Variable Ordering Heuristics
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
- Prediction-Based Adaptive Variable Ordering Heuristics for Constraint Satisfaction Problems (AAAI 2025 · similarity 0.93)
- Problem Difficulty and the Phase Transition in Heuristic Search (AAAI 2017 · similarity 0.83)
- Counting-Based Search for Constraint Optimization Problems (AAAI 2016 · similarity 0.83)
- The Impact of Literal Sorting on Cardinality Constraint Encodings (AAAI 2025 · similarity 0.82)
- Rethinking Neural Combinatorial Optimization for Vehicle Routing Problems with Different Constraint Tightness Degrees (NeurIPS 2025 · similarity 0.81)
- Anchor Search: A Unified Framework for Suboptimal Bidirectional Search (AAAI 2025 · similarity 0.81)
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.