Combinatorial Search: From Algorithms to Systems
Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to...
|Main Author:||Hamadi, Youssef.|
|Corporate Author:||SpringerLink (Online service)|
Berlin, Heidelberg :
Springer Berlin Heidelberg :
No Tags, Be the first to tag this record!