Research map / Learning theory and algorithms / Combinatorial and search optimization
Counting-Based Search for Constraint Optimization Problems
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| branch on cost-based solution densities (maxSD*) instead of dom or impact-based search | CP search · BACP | instances solved to optimality | Helped |
| cost-based solution densities instead of dom/IBS | CP search · TSP, within 10% of optimal | instances solved (%): 55% -> 90% | Helped |
| cost-based solution densities instead of dom/IBS/regret | CP search · TSP, optimal solutions | instances solved to optimality | Hurt |
| cost-based solution densities instead of dom/IBS | CP search · B2B meeting scheduling | instances solved (close) to optimality | Helped |
Closest papers by meaning
- Finding Good Partial Assignments during Restart-Based Branch and Bound Search (AAAI 2023 · similarity 0.87)
- Prediction-Based Adaptive Variable Ordering Heuristics for Constraint Satisfaction Problems (AAAI 2025 · similarity 0.84)
- Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model (ICML 2024 · similarity 0.84)
- What Are the Rules? Discovering Constraints from Data (AAAI 2024 · similarity 0.84)
- Model Counting and Sampling via Semiring Extensions (AAAI 2024 · similarity 0.84)
- Novelty vs. Potential Heuristics: A Comparison of Hardness Measures for Satisficing Planning (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.