Loading…
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...
Saved in:
Main Author: | |
---|---|
Corporate Author: | |
Format: | eBook |
Language: | English |
Published: |
Heidelberg :
Springer,
2013.
|
Physical Description: |
1 online resource (xiii, 139 pages) : illustrations (some color) |
Subjects: | |
Online Access: | SpringerLink - Click here for access |
Copy 1 | CMU Electronic Access | Available |
---|