scientific article; zbMATH DE number 2080317

MaRDI QIDQ4473036zbMATH OpenFDO

Authors Steven Prestwich

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1894/18940337.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

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)

• SAT problems with chains of dependent variables
• Finding the right hybrid algorithm -- A combinatorial meta-problem
• Backjump-based backtracking for constraint satisfaction problems
• Local search with constraint propagation and conflict-based heuristics
• A SAT approach to query optimization in mediator systems
• Exploiting relaxation in local search for LABS
• On-line resources allocation for ATM networks with rerouting
• Random backtracking in backtrack search algorithms for satisfiability
• Finding the right hybrid algorithm -- a combinatorial meta-problem
• A generic approach to combining stochastic algorithms with systematic constraint solvers
• The Relation Between Complete and Incomplete Search
• Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain
• Nondeterministic Control for Hybrid Search
• Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
• Nondeterministic control for hybrid search
• Heuristic-based backtracking relaxation for propositional satisfiability

Describes a project that uses

Uses Software

• CSPLib
• DIMACS

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)