MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

share|cite|improve this question
up vote 6 down vote accepted

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.

share|cite|improve this answer
You accidentally linked twice to the book by Papadimitriou and Stieglitz. – Someone Dec 20 '11 at 9:26
Edited, thanks. – Michael Biro Dec 20 '11 at 16:17
The second one is impressive. – 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)

share|cite|improve this answer
Thank you but I guess there is a gap between OR and combinatorial optimization. Isn't there? – Gighen Dec 19 '11 at 18:42
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. – Igor Rivin Dec 19 '11 at 19:26

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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