Skip to main navigation Skip to search Skip to main content

On the Best Search Strategy in Parallel|Branch-and-Bound - Best-First-Search vs. Lazy Depth-First-Search

  • Jens Clausen
  • , Michael Perregaard

    Research output: Contribution to journalJournal articleResearchpeer-review

    Original languageEnglish
    JournalAnnals of OR
    Issue number90
    Pages (from-to)1 - 17
    ISSN0254-5330
    Publication statusPublished - 1999

    Keywords

    • Parallel Branch and Bound
    • Search Strategy

    Cite this