After a brief summary of graph-theoretical definitions, a general presentation of the principles and components of branch-and-bound methods, as well as the fundamental approaches of heuristics, follows. Chapter 2 provides an extension of the discussions from Volume I (Logistics: Transport) by addressing nonlinear transportation and transshipment problems. In Chapters 3 to 5, the authors thoroughly discuss symmetric and asymmetric Traveling Salesman Problems, the Postman Problem in directed, undirected, and mixed graphs, as well as general routing problems. Recommended prerequisites: To understand the content of this volume, it is helpful for the reader to be familiar with opening and optimization methods for the classical transportation problem, as well as the Hungarian method for solving the linear assignment problem.