Structural properties of cost functions for paths in graphs; generalized principles of order preservatioin, generalized Bellman principles; combinatorial results on paths in graphs; the search for optimal paths in graphs - generalized versions of the Dijkstra algorithm and of the Ford-Bellman algorithm; optimal path problems and their solutions in special graphs, for example in planar or in random graphs; hard path problems, for example the Travelling Salesman problem.
