WorldCat Linked Data Explorer

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

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

Combinatorial optimization : theory and algorithms

This comprehensive 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, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided.

Open All Close All

type

about

http://schema.org/about

author

contributor

creator

description

http://schema.org/description

  • "This comprehensive textbook on combinatorial optimization places special℗¡emphasis on theoretical results and algorithms with provably good℗¡performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout,℗¡it contains complete but concise proofs, and also provides numerous℗¡exercises and references. This fifth edition has again been updated, revised, and significantly℗¡extended, with more than 60 new exercises and new material on various℗¡topics, including Cayley's formula, blocking flows, faster℗¡b-matching separation, multidimensional knapsack, multicommodity℗¡max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization. From the reviews of the previous editions: "This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Research Letters 33 (2005) "..... this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003) "... has become a standard textbook in the field." Zentralblatt MATH 1099.90054℗¡ "...gives an excellent comprehensive view of the exciting field of combinatorial optimization."℗¡ Zentralblatt MATH 1149.90126."
  • "This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. The book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. (source : 4ème de couv.)."
  • "Cet ouvrage décrit de manière détaillée les résultats théoriques et les algorithmes efficaces de l'optimisation combinatoire. Il présente des démonstrations concises mais complètes de nombreux résultats dont certains n'avaient jamais été exposés auparavant. De la théorie des graphes à la programmation linéaire, des problèmes de mariage aux théories des matroïdes et de la complexité, le propos couvre l'ensemble des thématiques classiques et contemporaines de ce champ qui compte parmi les plus actifs des mathématiques discrètes."
  • "Cet ouvrage décrit de manière détaillée les résultats théoriques et les algorithmes efficaces de l'optimisation combinatoire. Il présente des démonstrations concises mais complètes de nombreux résultats dont certains n'avaient jamais été exposés auparavant. De la théorie des graphes à la programmation linéaire, des problèmes de mariage aux théories des matroïdes et de la complexité, le propos couvre l'ensemble des thématiques classiques et contemporaines de ce champ qui compte parmi les plus actifs des mathématiques discrètes. Cette traduction française de la quatrième édition anglaise (la plus récente à la date de publication) intègre les dernières corrections des auteurs ainsi que des développements récents sur de nombreux sujets. Véritable référence de l'optimisation combinatoire, ce livre s'adresse principalement aux étudiants en mathématiques et en informatique des 2e et 3e cycles universitaires, ainsi qu'aux ingénieurs et aux chercheurs confrontés à des problèmes d'optimisation."
  • "Ce livre est la traduction fran aise de la quatri me et derni re dition de Combinatorial Optimization: Theory and Algorithms crit par deux minents sp cialistes du domaine: Bernhard Korte et Jens Vygen de l'universit de Bonn en Allemagne. Il met l accent sur les aspects th oriques de l'optimisation combinatoire ainsi que sur les algorithmes efficaces et exacts de r solution de probl mes. Il se distingue en cela des approches heuristiques plus simples et souvent d crites par ailleurs. L ouvrage contient de nombreuses d monstrations, concises et l gantes, de r sultats difficiles. Destin aux tudia."
  • "Questo libro di testo di ottimizzazione combinatoria pone in particolare risalto i risultati teorici e gli algoritmi che, al contrario delle euristiche, hanno una garanzia di avere buone prestazioni. Comprende una vasta scelta di argomenti e nasce come riferimento di diversi corsi di ottimizzazione combinatoria sia di base che di livello avanzato. Il libro contiene dimostrazioni complete (ma concise) anche di molti risultati avanzati, alcuni dei quali non sono mai apparsi prima in un libro. Vengono anche trattati molti dei temi di ricerca più attuali e sono riportati molti riferimenti alla letteratura. Quindi questo libro, traduzione della quarta edizione in lingua originale, rappresenta lo stato dell'arte dell'ottimizzazione combinatoria."
  • "This comprehensive 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, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided."@en

genre

http://schema.org/genre

  • "Electronic books"@en
  • "Problèmes et exercices (Descripteur de forme)"
  • "Electronic books"
  • "Online-Publikation"
  • "Ressources Internet"
  • "Matériel didactique"
  • "Leermiddelen (vorm)"@en
  • "Llibres electrònics"

name

http://schema.org/name

  • "Ottimizzazione Combinatoria Teoria e Algoritmi"
  • "Combinatorial Optimization"
  • "Optimisation combinatoire : théorie et algorithmes"
  • "Combinatorial optimization : Theory and algorithms"
  • "Combinatorial optimization : theory and algorithms"@en
  • "Combinatorial optimization : theory and algorithms"
  • "Ottimizzazione combinatoria teoria e algoritmi"
  • "Optimisation combinatoire Théorie et algorithmes"
  • "Optimisation combinatoire theorie et algorithmes"
  • "Optimisation combinatoire théorie et algorithmes"
  • "Ottimizzazione combinatoria : teoria e algoritmi"@it
  • "Optimisation combinatoire : Théorie et algorithmes"
  • "Combinatorial Optimization : Theory and Algorithms"
  • "Optimisation combinatoire : théories et algorithmes"
  • "Combinatorial optimization theory and algorithms"@en
  • "Combinatorial optimization theory and algorithms"
  • "Combinatorial optimization Theory and Algorithms"
  • "Combinatorial optimization"
  • "Combinatorial Optimization Theory and Algorithms"
  • "Combinatorial Optimization Theory and Algorithms"@en

workExample

http://schema.org/workExample