Data Correcting Approaches in Combinatorial Optimization

Boris I. Goldengorin, Panos M. Pardalos

PDF
ca. 50,28
Amazon 37,42 € iTunes Thalia.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 New York img Link Publisher

Naturwissenschaften, Medizin, Informatik, Technik / Sonstiges

Beschreibung

​​​​​​​​​​​​​​​​​ Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems.  Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis  as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization  introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance  one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.​

Weitere Titel in dieser Kategorie
Cover Mindmatics
Yair Neuman

Kundenbewertungen

Schlagwörter

combinatorial optimization, data structures, cluster analysis, algorithm analysis and problem complexity, data correcting algorithms, algorithmics