Combinatorial Optimization: Polyhedra and Efficiency

Combinatorial Optimization Polyhedra and Efficiency An in depth overview of polyhedral methods and efficient algorithms in combinatorial optimization These methods form a broad coherent and powerful kernel in combinatorial optimization with strong li

  • Title: Combinatorial Optimization: Polyhedra and Efficiency
  • Author: Alexander Schrijver
  • ISBN: 9783540443896
  • Page: 210
  • Format: Hardcover
  • An in depth overview of polyhedral methods and efficient algorithms in combinatorial optimization These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science In eight parts, various areas are treated, each starting with an elementary introduction to the arAn in depth overview of polyhedral methods and efficient algorithms in combinatorial optimization These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the advanced methods and results, with full proofs of some of the deepest theorems in the area Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.

    One thought on “Combinatorial Optimization: Polyhedra and Efficiency”

    Leave a Reply

    Your email address will not be published. Required fields are marked *