Combinatorial Optimization

Offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.Rhese techniques form a powerful kernel in combinatoria... » 

Offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.Rhese techniques form a powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming, and computer science. In eight parts various areas are treated, each with an elementary introduction and evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. «