scientific article; zbMATH DE number 2080317

zbMath1044.68789MaRDI QIDQ4473036

Steven Prestwich

Publication date: 4 August 2004

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

Random backtracking in backtrack search algorithms for satisfiability ⋮ Heuristic-based backtracking relaxation for propositional satisfiability ⋮ The Relation Between Complete and Incomplete Search ⋮ SAT problems with chains of dependent variables ⋮ Exploiting relaxation in local search for LABS ⋮ On-line resources allocation for ATM networks with rerouting ⋮ A SAT approach to query optimization in mediator systems ⋮ Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes ⋮ Backjump-based backtracking for constraint satisfaction problems ⋮ Local search with constraint propagation and conflict-based heuristics

Uses Software

• CSPLib
• DIMACS