Combinatorial Optimization: Theory and Algorithms

Front Cover
Springer Science & Business Media, Jan 27, 2006 - Mathematics - 597 pages
0 Reviews

This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Introduction
1
Graphs
13
Linear Programming
49
Linear Programming Algorithms
65
5
91
15
343
Network Design Problems
467
The Traveling Salesman Problem
501
Facility Location 537
536
Notation Index
573
Subject Index
585
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information