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

Bibliographic Details
Main Author: Hamadi, Youssef (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
Subjects:
Online Access:Full Text via HEAL-Link

Internet

Full Text via HEAL-Link

ΒΚΠ - Πατρα: ALFd

Holdings details from ΒΚΠ - Πατρα: ALFd
Call Number: 330.01 BAU
Copy 1 Available

ΒΚΠ - Πατρα: BSC

Holdings details from ΒΚΠ - Πατρα: BSC
Call Number: 330.01 BAU
Copy 2 Available
Copy 3 Available