Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
International Journal of Applied Mathematics and Computer Science
Volume 24 (2014): Issue 4 (December 2014)
Open Access
Accelerating backtrack search with a best-first-search strategy
Zoltán Ádám Mann
Zoltán Ádám Mann
Search for this author on
Sciendo
|
Google Scholar
Mann, Zoltán Ádám
and
Tamás Szép
Tamás Szép
Search for this author on
Sciendo
|
Google Scholar
Szép, Tamás
Dec 20, 2014
International Journal of Applied Mathematics and Computer Science
Volume 24 (2014): Issue 4 (December 2014)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Download Cover
Published Online:
Dec 20, 2014
Page range:
901 - 916
Received:
Feb 02, 2014
DOI:
https://doi.org/10.2478/amcs-2014-0066
Keywords
best-first search
,
backtrack
,
branch-and-bound
,
constraint satisfaction problem
,
frequent restarting
© by Zoltán Ádám Mann
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
