Fundaments of Branching Heuristics. Kullmann, O. 185(1):205–244. doi abstract bibtex "Search trees", "branching trees", "backtracking trees" or "enumeration trees" are at the heart of many (complete) approaches towards hard combinatorial problems, constraint problems, and, of course, SAT problems. Given many choices for branching, the fundamental question is how to guide the choices so that the resulting trees are (relatively) small. Despite (or perhaps because) of its apparently more narrow scope, especially in the SAT area several approaches from theory and applications have found together, and the rudiments of a theory of branching heuristics emerged. In this chapter the first systematic treatment is given. So a general theory of heuristics guiding the construction of "branching trees" is developed, ranging from a general theoretical analysis to the analysis of the historical development of branching heuristics for SAT solvers, and also to heuristics beyond SAT solving. © 2009 John Franco and John Martin and IOS Press.
@article{kullmannFundamentsBranchingHeuristics2009,
title = {Fundaments of Branching Heuristics},
volume = {185},
issn = {09226389},
doi = {10.3233/978-1-58603-929-5-205},
abstract = {"Search trees", "branching trees", "backtracking trees" or "enumeration trees" are at the heart of many (complete) approaches towards hard combinatorial problems, constraint problems, and, of course, SAT problems. Given many choices for branching, the fundamental question is how to guide the choices so that the resulting trees are (relatively) small. Despite (or perhaps because) of its apparently more narrow scope, especially in the SAT area several approaches from theory and applications have found together, and the rudiments of a theory of branching heuristics emerged. In this chapter the first systematic treatment is given. So a general theory of heuristics guiding the construction of "branching trees" is developed, ranging from a general theoretical analysis to the analysis of the historical development of branching heuristics for SAT solvers, and also to heuristics beyond SAT solving. © 2009 John Franco and John Martin and IOS Press.},
number = {1},
journaltitle = {Frontiers in Artificial Intelligence and Applications},
date = {2009},
pages = {205--244},
author = {Kullmann, Oliver},
file = {/home/dimitri/Nextcloud/Zotero/storage/2AM5IVWL/SATChapter7.pdf}
}
Downloads: 0
{"_id":"c7Q4qGFc5m2uPZEhp","bibbaseid":"kullmann-fundamentsofbranchingheuristics","authorIDs":[],"author_short":["Kullmann, O."],"bibdata":{"bibtype":"article","type":"article","title":"Fundaments of Branching Heuristics","volume":"185","issn":"09226389","doi":"10.3233/978-1-58603-929-5-205","abstract":"\"Search trees\", \"branching trees\", \"backtracking trees\" or \"enumeration trees\" are at the heart of many (complete) approaches towards hard combinatorial problems, constraint problems, and, of course, SAT problems. Given many choices for branching, the fundamental question is how to guide the choices so that the resulting trees are (relatively) small. Despite (or perhaps because) of its apparently more narrow scope, especially in the SAT area several approaches from theory and applications have found together, and the rudiments of a theory of branching heuristics emerged. In this chapter the first systematic treatment is given. So a general theory of heuristics guiding the construction of \"branching trees\" is developed, ranging from a general theoretical analysis to the analysis of the historical development of branching heuristics for SAT solvers, and also to heuristics beyond SAT solving. © 2009 John Franco and John Martin and IOS Press.","number":"1","journaltitle":"Frontiers in Artificial Intelligence and Applications","date":"2009","pages":"205–244","author":[{"propositions":[],"lastnames":["Kullmann"],"firstnames":["Oliver"],"suffixes":[]}],"file":"/home/dimitri/Nextcloud/Zotero/storage/2AM5IVWL/SATChapter7.pdf","bibtex":"@article{kullmannFundamentsBranchingHeuristics2009,\n title = {Fundaments of Branching Heuristics},\n volume = {185},\n issn = {09226389},\n doi = {10.3233/978-1-58603-929-5-205},\n abstract = {\"Search trees\", \"branching trees\", \"backtracking trees\" or \"enumeration trees\" are at the heart of many (complete) approaches towards hard combinatorial problems, constraint problems, and, of course, SAT problems. Given many choices for branching, the fundamental question is how to guide the choices so that the resulting trees are (relatively) small. Despite (or perhaps because) of its apparently more narrow scope, especially in the SAT area several approaches from theory and applications have found together, and the rudiments of a theory of branching heuristics emerged. In this chapter the first systematic treatment is given. So a general theory of heuristics guiding the construction of \"branching trees\" is developed, ranging from a general theoretical analysis to the analysis of the historical development of branching heuristics for SAT solvers, and also to heuristics beyond SAT solving. © 2009 John Franco and John Martin and IOS Press.},\n number = {1},\n journaltitle = {Frontiers in Artificial Intelligence and Applications},\n date = {2009},\n pages = {205--244},\n author = {Kullmann, Oliver},\n file = {/home/dimitri/Nextcloud/Zotero/storage/2AM5IVWL/SATChapter7.pdf}\n}\n\n","author_short":["Kullmann, O."],"key":"kullmannFundamentsBranchingHeuristics2009","id":"kullmannFundamentsBranchingHeuristics2009","bibbaseid":"kullmann-fundamentsofbranchingheuristics","role":"author","urls":{},"downloads":0},"bibtype":"article","biburl":"https://raw.githubusercontent.com/dlozeve/newblog/master/bib/all.bib","creationDate":"2020-01-08T20:39:39.018Z","downloads":0,"keywords":[],"search_terms":["fundaments","branching","heuristics","kullmann"],"title":"Fundaments of Branching Heuristics","year":null,"dataSources":["3XqdvqRE7zuX4cm8m"]}