Data Correcting Approaches in Combinatorial Optimization

2012
ISBN: 978-1-4614-5285-0
Verlag: Springer

Buch, Englisch, 114 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 201 g

Reihe: SpringerBriefs in Optimization

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.

Zielgruppe

Research

Autoren/Hrsg.

Pardalos, Panos M.

Goldengorin, Boris I.

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle

Inhaltsverzeichnis

-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.