## Pedagogy To motivate the student, we begin each chapter with a story that relates to the material in the chapter. In addition, we use many examples and end the chapters with ample exercises, which are grouped by section. Following the section exercises are supplementary exercises that are often more challenging. To show that there is more than one way to attack a problem, we solve some problems using more than one technique. For example, we solve the Traveling Salesperson Problem using dynamic programming, branch-and-bound, and an approximation algorithm. We solve the 0–1 Knapsack Problem using dynamic programming, backtracking, and branch-and-bound. To further integrate the material, we present a theme that spans several chapters, concerning a salesperson named Nancy who is looking for an optimal tour for her sales route.