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...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | Hamadi, Youssef (Autor) |
Autor Corporativo: | SpringerLink (Online service) |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2013.
|
Edición: | 1st ed. 2013. |
Temas: | |
Acceso en línea: | Texto Completo |
Ejemplares similares
-
Theoretical Aspects of Local Search
por: Michiels, Wil, et al.
Publicado: (2007) -
Instance-Specific Algorithm Configuration
por: Malitsky, Yuri
Publicado: (2014) -
Decision Diagrams for Optimization
por: Bergman, David, et al.
Publicado: (2016) -
Discrete Optimization and Operations Research 9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings /
Publicado: (2016) -
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010, Proceedings /
Publicado: (2010)