Learning and fine-tuning a generic value-selection heuristic inside a constraint programming solver
From MaRDI portal
Cites work
- Benchmarking optimization software with performance profiles.
- Discrete optimization with decision diagrams
- Guiding high-performance SAT solvers with unsat-core predictions
- Improving variable orderings of approximate decision diagrams using reinforcement learning
- Learning a classification of mixed-integer quadratic programming problems
- Learning the travelling salesperson problem requires rethinking generalization
- Learning value heuristics for constraint programming
- Learning variable activity initialisation for lazy clause generation solvers
- Learning when to use a decomposition
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- MiniCP: a lightweight solver for constraint programming
- On the power of color refinement
- Principles and Practice of Constraint Programming – CP 2004
- Reinforcement learning for combinatorial optimization: a survey
- Reinforcement learning. An introduction
- Robust Estimation of a Location Parameter
- SeaPearl: a constraint programming solver guided by reinforcement learning
- Statistical mechanics of complex networks
This page was built for publication: Learning and fine-tuning a generic value-selection heuristic inside a constraint programming solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7018064)
