PBeFS

Getting started

  • Parallel Best-First Search
  • Building and using the library

User guide

  • The search problem
  • The algorithms
  • Branch-and-bound
  • Best-first search with an incumbent: design note
  • The data structures
  • The examples and the benchmark
  • Testing
  • References

Theory

  • Best-first search and A*
  • Parallel A*
  • Pattern databases
  • Branch-and-bound as best-first search
  • Parallel branch-and-bound

API reference

  • API reference

Project

  • Release notes
PBeFS
  • Search

© Copyright 2026, Donato Meoli.

Built with Sphinx using a theme provided by Read the Docs.