I really enjoyed reading Hans Kellerer, David Pisinger, Ulrich Pferschy 2004 book Knapsack Problems. Can anybody recommend books in a similar style, about some other classes of problems / optimisation?

  • 3
    $\begingroup$ welcome! can you give us more details on the "style" you like, is it because of the many applications, because of the precise math, since it is a discrete optimization problem, or because it is algorithmic? what is it precisely that you like about the book? $\endgroup$ Commented Oct 28, 2019 at 13:06
  • $\begingroup$ Yes, I liked all of those things about the book! $\endgroup$
    – gornvix
    Commented Oct 28, 2019 at 13:33
  • $\begingroup$ I also liked it because it is mostly easy to follow, but I guess that is subjective. $\endgroup$
    – gornvix
    Commented Oct 29, 2019 at 15:09
  • $\begingroup$ Although it is discrete optimisation, I like how the algorithms often rely on linear relaxations of one form or another. $\endgroup$
    – gornvix
    Commented Nov 1, 2019 at 19:17

1 Answer 1


I waited some time but apparently no easy answer here. Thanks for providing some more hints in the comments to your question. One specialty about the knapsack book is: it is a monograph, that is, written by the same author(s). There are only few other books about a particular combinatorial optimization problem, with theory and algorithmic components, and precise in the mathematics, and the "LPs are used" portion.

A brilliant example is In Pursuit of the Traveling Salesman - Mathematics at the Limits of Computation by Bill Cook.

Often, books are collections, that is, they are edited by a small number of researchers, but the single chapters are written by different people, and thus usually differ in style and presentation; usually, there is not much coherence in terms of cross references among chapters etc.

One example is the area of vehicle routing, with books like The Vehicle Routing Problem by Golden et al., or Vehicle Routing: Problems, Methods, and Applications by Toth and Vigo.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.