scientific article; zbMATH DE number 2080317
From MaRDI portal
Publication:4473036
Recommendations
- A generic approach to combining stochastic algorithms with systematic constraint solvers
- Local Search and Constraint Programming
- Combining the scalability of local search with the pruning techniques of systematic search
- scientific article; zbMATH DE number 2085252
- Stochastic systematic search algorithms for satisfiability
Cited in
(16)- Backjump-based backtracking for constraint satisfaction problems
- Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
- On-line resources allocation for ATM networks with rerouting
- Exploiting relaxation in local search for LABS
- A generic approach to combining stochastic algorithms with systematic constraint solvers
- Nondeterministic control for hybrid search
- Nondeterministic Control for Hybrid Search
- Heuristic-based backtracking relaxation for propositional satisfiability
- Local search with constraint propagation and conflict-based heuristics
- Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain
- The Relation Between Complete and Incomplete Search
- Random backtracking in backtrack search algorithms for satisfiability
- Finding the right hybrid algorithm -- A combinatorial meta-problem
- Finding the right hybrid algorithm -- a combinatorial meta-problem
- SAT problems with chains of dependent variables
- A SAT approach to query optimization in mediator systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473036)
