Accelerating backtrack search with a best-first-search strategy
type: Item
instance of: scholarly article
title: Accelerating backtrack search with a best-first-search strategy
zbMATH Open document ID: 1309.68172
author: Zoltán Ádám Mann
author: Tamás Szép
published in: International Journal of Applied Mathematics and Computer Science
publication date: 2015-04-14T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6424844
zbMATH Keywords: best-first search
zbMATH Keywords: backtrack
zbMATH Keywords: branch-and-bound
zbMATH Keywords: constraint satisfaction problem
zbMATH Keywords: frequent restarting
zbMATH Keywords: NP-hard problems
describes a project that uses: MiniSat
describes a project that uses: Chaff
MaRDI profile type: Publication
full work available at URL: amcs-2014-0066
OpenAlex ID: W2149352721
cites work: A theoretical analysis of backtracking in the graph coloring problem
cites work: Adaptive Restart Strategies for Conflict Driven SAT Solvers
cites work: New methods to color the vertices of a graph
cites work: Q4203815
cites work: Chromatic Scheduling and the Chromatic Number Problem
cites work: Q4012216
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
cites work: Backjump-based backtracking for constraint satisfaction problems
cites work: Theory and Applications of Satisfiability Testing
cites work: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
cites work: The hardest constraint problems: A double phase transition
cites work: Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Estimating the Efficiency of Backtrack Programs
cites work: Optimal speedup of Las Vegas algorithms
cites work: An agent-based model of hierarchic genetic search
cites work: Backtrack: An O(1) expected time algorithm for the graph coloring problem
DOI: 10.2478/AMCS-2014-0066
Recommended article: Q4818869
Recommended article: Q3489496
Recommended article: Q3373594
Recommended article: Efficiency of randomized parallel backtrack search
Recommended article: On Universal Restart Strategies for Backtracking Search
Recommended article: Optimal speedup for backtrack search on a butterfly network
Recommended article: Evaluation of a simple, scalable, parallel best-first search strategy
Recommended article: Deterministic parallel backtrack search
description: scientific article; zbMATH DE number 6424844