Weekly Notes for Week 29

This week we will discuss k-shortest paths and synthesis planning.

• Topics:

  • k-shortest path problems and why they occur naturally in pathway and synthesis-plan search.
  • Ranking alternatives instead of returning a single best solution.
  • Synthesis plans as search objects: routes, costs, and alternative decompositions.
  • How these ideas connect back to graph search, hypergraphs, and earlier network-expansion material.

• Slides and reading:

  • k-shortest paths slides
  • k-shortest paths reading

• Exercises and exam preparation:

  • Mandatory Exercise Sheet 02
  • Preliminary exam question overview