Much of the material in this book presupposes a basic understanding of classical optimization methods, particularly linear programming, network flows, convex nonlinear programming, and dynamic programming. Linear programming is a ubiquitous relaxation tool and finds application in domain reduction, branch-and-price methods, and other techniques. Network flows play a central role in filtering
... [Show full abstract] methods for several global constraints. Nonlinear programming is used to solve convex relaxations and reduce variable domains in global optimization problems. Dynamic programming can be useful for domain reduction in sequencing problems and elsewhere.