On Universal Restart Strategies for Backtracking Search

DOI10.1007/978-3-540-74970-7_48zbMath1145.68533OpenAlexW1732358269MaRDI QIDQ3523083

Huayue Wu, Peter J. L. van Beek

Publication date: 2 September 2008

Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_48

Mathematics Subject Classification ID

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

Related Items (4)

A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem ⋮ Explorative anytime local search for distributed constraint optimization ⋮ An Optimal Constraint Programming Approach to the Open-Shop Problem ⋮ Ant colony optimization for path planning in search and rescue operations

Uses Software

• MiniSat

Cites Work

• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Theory and Applications of Satisfiability Testing

This page was built for publication: On Universal Restart Strategies for Backtracking Search