I have a background in computer science and I am starting to work on some problems those are basically combinatorial optimization problems.

I have good knowleges of graphs, *-flow algorithms and so on and I took some courses about operations research and similar stuff.

I am looking for one (or two) book to get a uniform and semi-complete view on the topic.


For the short version, Combinatorial Optimization by Papadimitriou and Stieglitz is a good introduction, and at $12, you can't really go wrong.

For the in-depth version, Combinatorial Optimization by Schrijver is pretty encyclopedic.

  • $\begingroup$ You accidentally linked twice to the book by Papadimitriou and Stieglitz. $\endgroup$ – Someone Dec 20 '11 at 9:26
  • $\begingroup$ The second one is impressive. $\endgroup$ – Gighen Dec 23 '11 at 12:10

Operative research -> operations research. A great reference is:

Introduction To Operations Research (IBM) [Hardcover] Frederick S. Hillier (Author), Gerald J. Lieberman (Author)

  • $\begingroup$ Thank you but I guess there is a gap between OR and combinatorial optimization. Isn't there? $\endgroup$ – Gighen Dec 19 '11 at 18:42
  • $\begingroup$ Well, if you know CS, you know the other part of combinatorial optimization (as you say yourself, network flows, etc). So, the OR is the part you are missing. $\endgroup$ – Igor Rivin Dec 19 '11 at 19:26

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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