Details

Data Correcting Approaches in Combinatorial Optimization


Data Correcting Approaches in Combinatorial Optimization


SpringerBriefs in Optimization

von: Boris I. Goldengorin, Panos M. Pardalos

50,28 €

Verlag: Springer
Format: PDF
Veröffentl.: 10.10.2012
ISBN/EAN: 9781461452867
Sprache: englisch
Anzahl Seiten: 114

Dieses eBook enthält ein Wasserzeichen.

Beschreibungen

​​​​​​​​​​​​​​​​​<i>Data Correcting Approaches in Combinatorial Optimization</i> 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.​
<p>-1. Introduction. -2. Maximization of Submodular Functions: Theory and Algorithms.  -3. Data Correcting Approach for the Maximization of Submodular Functions. -4. Data Correcting Approach for the Simple Plant Location Problem. –References. <b></p>
Focuses on algorithmic applications of well known polynomially solvable special cases of computationally intractable problems Discusses design of practically efficient algorithms for solving wide classes of combinatorial optimization problems?? Presents a new approach to study optimization problems both from theoretical and practical points of view Includes supplementary material: sn.pub/extras Includes supplementary material: sn.pub/extras

Diese Produkte könnten Sie auch interessieren:

Marginal Models
Marginal Models
von: Wicher Bergsma, Marcel A. Croon, Jacques A. Hagenaars
PDF ebook
96,29 €
Reactive Search and Intelligent Optimization
Reactive Search and Intelligent Optimization
von: Roberto Battiti, Mauro Brunato, Franco Mascia
PDF ebook
96,29 €