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...

Full description

Main Author: Hamadi, Youssef.
Corporate Author: SpringerLink (Online service)
Format: Electronic
Language: English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : 2013.
Subjects:
Online Access: http://dx.doi.org/10.1007/978-3-642-41482-4
Tags: Add Tag
No Tags, Be the first to tag this record!