Accelerating backtrack search with a best-first-search strategy
DOI10.2478/AMCS-2014-0066zbMATH Open1309.68172OpenAlexW2149352721MaRDI QIDQ2018417FDOQ2018417
Authors: Zoltán Ádám Mann, Tamás Szép 
Publication date: 14 April 2015
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/amcs-2014-0066
Recommendations
- scientific article; zbMATH DE number 2102781
- Publication:3489496
- scientific article; zbMATH DE number 5012413
- Efficiency of randomized parallel backtrack search
- On Universal Restart Strategies for Backtracking Search
- Optimal speedup for backtrack search on a butterfly network
- Evaluation of a simple, scalable, parallel best-first search strategy
- Deterministic parallel backtrack search
NP-hard problemsbranch-and-boundconstraint satisfaction problembacktrackbest-first searchfrequent restarting
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Cites Work
- Theory and Applications of Satisfiability Testing
- Backtrack: An O(1) expected time algorithm for the graph coloring problem
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
- New methods to color the vertices of a graph
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Optimal speedup of Las Vegas algorithms
- The hardest constraint problems: A double phase transition
- Title not available (Why is that?)
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Estimating the Efficiency of Backtrack Programs
- Chromatic Scheduling and the Chromatic Number Problem
- An agent-based model of hierarchic genetic search
- A theoretical analysis of backtracking in the graph coloring problem
- Principles and Practice of Constraint Programming – CP 2004
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Backjump-based backtracking for constraint satisfaction problems
- Title not available (Why is that?)
Cited In (6)
- PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking
- A hybrid graph representation for recursive backtracking algorithms
- How To Be Fickle
- On Universal Restart Strategies for Backtracking Search
- Title not available (Why is that?)
- A solution to the GHI problem for best-first search
Uses Software
This page was built for publication: Accelerating backtrack search with a best-first-search strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018417)
