This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast

Historically, there is a close connection between geometry and optImization. This is illustrated by methods like the gradient method and the simplex method, whi

Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the m

From the reviews: "About 30 years ago, when I was a student, the first book on combinatorial optimization came out referred to as "the Lawler" simply. I think t

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. Th