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: | |
|---|---|
| Corporate Author: | |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2013.
|
| Edition: | 1st ed. 2013. |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/978-3-642-41482-4 |