Pedigree Polytopes

New Insights on Computational Complexity of Combinatorial Optimisation Problems

Tirukkattuppalli Subramanyam Arthanari

PDF
ca. 149,79
Amazon iTunes Thalia.de Weltbild.de Hugendubel Bücher.de ebook.de kobo Osiander Google Books Barnes&Noble bol.com Legimi yourbook.shop Kulturkaufhaus ebooks-center.de
* Affiliatelinks/Werbelinks
Hinweis: Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.

Springer Nature Singapore img Link Publisher

Naturwissenschaften, Medizin, Informatik, Technik / Informatik

Beschreibung

This book defines and studies a combinatorial object called the pedigree and develops the theory for optimising a linear function over the convex hull of pedigrees (the Pedigree polytope). A strongly polynomial algorithm implementing the framework given in the book for checking membership in the pedigree polytope is a major contribution.

This book challenges the popularly held belief in computer science that a problem included in the NP-complete class may not have a polynomial algorithm to solve. By showing STSP has a polynomial algorithm, this book settles the P vs NP question.

This book has illustrative examples, figures, and easily accessible proofs for showing this unexpected result. This book introduces novel constructions and ideas previously not used in the literature. Another interesting feature of this book is it uses basic max-flow and linear multicommodity flow algorithms and concepts in theseproofs establishing efficient membership checking for the pedigree polytope. Chapters 3-7 can be adopted to give a course on Efficient Combinatorial Optimization. This book is the culmination of the author's research that started in 1982 through a presentation on a new formulation of STSP at the XIth International Symposium on Mathematical Programming at Bonn.

Weitere Titel in dieser Kategorie

Kundenbewertungen

Schlagwörter

Polynomial Solvability, Pedigree Polytopes, Efficient algorithm, Polynomial Time Algorithms, Symmetric Traveling Salesman Problem, Maximal flow problem, Good algorithm, Polyhedral Combinatorics, Computational Complexity, Combinatorial Optimization, Combinatorial Optimisation, NP vs P, NP-completeness