Combinatorial optimization. Theory and algorithms. (Q5915481): Difference between revisions

It speaks well for this book that a new edition became necessary about a year after the first one. It describes the most important ideas, theoretical results, and algorithms in combinatorial optimization and includes the essential fundamentals of graph theory, linear and integer programming, and complexity theory. The book can be warmly recommended to students as well as to researchers. Referring to the table of contens, cf. the review of the first edition (2000) in Zbl 0953.90052. For the second edition some corrections and updates of references have been made.