WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/839177094

Combinatorial optimization polyhedra and efficiency

"This [electronic] book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization. These techniques form a powerful, coherent, and unifying 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 more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4500 references to further research are given, and historical surveys on the basic subjects are presented"--Container.

Open All Close All

type

about

http://schema.org/about

author

contributor

creator

description

http://schema.org/description

  • "From the reviews: Schrijver's 3 volumes on combinatorial optimization reflect the current state of the art in this field, in particular from the viewpoint of polyhedral combinatorics and efficient algorithms. [...] The book offers a masterly introduction with many interesting historical remarks as well as an in-depth survey of combinatorial optimization. It is divided into eight main parts with 83 chapters. The main parts are (I) paths and flows, (II) bipartite matching and covering, (III) nonbipartite matching and covering, (IV) matroids and submodular functions, (V) trees, branchings and connectors, (VI) cliques, stable sets and colouring, (VII) multiflows and disjoint paths and, finally, (VIII) hypergraphs.[...] The reader is supposed to have a basic knowledge of graph theory and linear as well as integer programming. The author gives short and elegant proofs to all main results. [...]These three volumes contain an immense richness of results up to 2002 and will prove to be indispensible for any further research in the field of combinatorial optimization. Rainer E. Burkard (Graz) Zentralblatt Math Database, 2003 [..] Now comes Schrijver's book, a current and extremely comprehensive account, running 1,451 pages; by itself the bibliography would make a long book. But even as the book provides reference material to satisfy the experts, strong undergraduates will profit by dipping straight into nearly any chapter. Mathematics and computer science students should consult it, both to supplement their theoretical coursework or to find algorithms for practical projects. Summing Up: All three books: Recommended. Upper-division undergraduates through faculty. American Library Association, 2003 TOC:Introduction.- Paths and Flows.- Bipartite Matching and Covering.- Nonbipartite Matching and Covering.- Matroids and Submodular Functions.- Trees, Branchings, and Connectors.- Cliques, Stable Sets and Colouring.- Multiflows and Disjoint Paths.- Hypergraphs.- Survey of Problems, Questions and Conjectures.- References.- Name Index.- Subject Index."
  • ""This [electronic] book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization. These techniques form a powerful, coherent, and unifying 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 more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4500 references to further research are given, and historical surveys on the basic subjects are presented"--Container."@en
  • "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 area, with short, elegant proofs of the principal results, and each evolving to the more 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."

genre

name

http://schema.org/name

  • "Combinatorial optimization polyhedra and efficiency"
  • "Combinatorial optimization polyhedra and efficiency"@en
  • "Combinatorial optimization : polyedra and efficiency"
  • "Combinatorial optimization/ A, Paths, flows, matchings, chapters 1 - 38"
  • "Combinatorial optimization : polyhedra and efficiency"
  • "Combinatorial optimization : polyhedra and efficiency. [1]= Vol. A, Paths, flows, matchings : chapters 1 - 38"
  • "Combinatorial optimization : polyhedra and efficiency. Vol. A. Paths, flows, matchings, chapters 1-38"
  • "Combinatorial optimization"

workExample