A generic approach to combining stochastic algorithms with systematic constraint solvers
From MaRDI portal
Recommendations
- Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
- A hybrid search architecture applied to hard random 3-SAT and low-autocorrelation binary sequences
- Hybrid Algorithms in Constraint Programming
- Local Search and Constraint Programming
- A general approach for constraint solving by local search
Cited in
(17)- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Finding the right hybrid algorithm -- A combinatorial meta-problem
- Online control of enumeration strategies via bat algorithm and black hole optimization
- A new constraint test-case generator and the importance of hybrid optimizers
- Generating feasible schedules for a pick-up and delivery problem
- Using an incomplete version of dynamic backtracking for graph colouring
- Finding the right hybrid algorithm -- a combinatorial meta-problem
- Stochastic systematic search algorithms for satisfiability
- Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain
- scientific article; zbMATH DE number 1332640 (Why is no real title available?)
- A hybrid search architecture applied to hard random 3-SAT and low-autocorrelation binary sequences
- scientific article; zbMATH DE number 1437203 (Why is no real title available?)
- Nondeterministic Control for Hybrid Search
- Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
- Stochastic constraint programming: A scenario-based approach
- Nondeterministic control for hybrid search
- Confidence-based reasoning in stochastic constraint programming
This page was built for publication: A generic approach to combining stochastic algorithms with systematic constraint solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2782493)
