Parallel Combinatorial Search

Combinatorial search involves the systematic exploration of the space of configurations, or states, of a problem domain. A set of operators can transform a given state to a series of successor states. The objective of the exploration is to find one, all or optimal goal states satisfying certain desired properties, possibly along with a path from the start state to each goal. Combinatorial search has widespread applications in optimization, logic programming and artificial intelligence.

Laxmikant V. Kale and Pritish Jetley, Parallel Combinatorial Search, Encyclopedia of Parallel Computing, David Padua, Ed., 2011 (to appear)

@incollection{ParCombSearchEncyEntry11,
  author = "Laxmikant V. Kale and Pritish Jetley",
  title = "{Parallel Combinatorial Search}",
  booktitle = "Encyclopedia of Parallel Computing",
  publisher = "Springer Verlag",
  year = "2011",
  editor = "D. Padua",
}