| 书目名称 | State-Space Search | | 副标题 | Algorithms, Complexi | | 编辑 | Weixiong Zhang | | 视频video | | | 图书封面 |  | | 描述 | This book is about problem solving. Specifically, it is about heuristic state-space search under branch-and-bound framework for solving com binatorial optimization problems. The two central themes of this book are the average-case complexity of heuristic state-space search algorithms based on branch-and-bound, and their applications to developing new problem-solving methods and algorithms. Heuristic state-space search is one of the fundamental problem-solving techniques in Computer Science and Operations Research, and usually constitutes an important component of most intelligent problem-solving systems. The search algorithms considered in this book can be classified into the category of branch-and-bound. Branch-and-bound is a general problem-solving paradigm, and is one of the best techniques for optimally solving computation-intensive problems, such as scheduling and planning. The main search algorithms considered include best-first search, depth first branch-and-bound, iterative deepening, recursive best-first search, and space-bounded best-first search. Best-first search and depth-first branch-and-bound are very well known and have been used extensively in Computer Science an | | 出版日期 | Book 1999 | | 关键词 | Extension; Notation; Variable; algorithms; combinatorial optimization; complexity; complexity theory; heuri | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4612-1538-7 | | isbn_softcover | 978-1-4612-7183-3 | | isbn_ebook | 978-1-4612-1538-7 | | copyright | Springer-Verlag New York, Inc. 1999 |
The information of publication is updating
|
|
发表于 2025-3-21 18:45:02
