## Data Correcting Approaches in Combinatorial OptimizationData 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. |

### What people are saying - Write a review

American Mathematical Society.

MathSciNet. Mathematical Reviews on the WebMR2978563 (Review) 90-02 (90C27)

Goldengorin, Boris [Goldengorin, Boris I.] (RS-HSE2-ANA); Pardalos, Panos M. (1-FL-AO) F Data correcting approaches in combinatorial optimization.

Springer Briefs in Optimization. Springer, New York, 2012. x+114 pp. euro 53.45. ISBN 978-1-4614-5285-0; 978-1-4614-5286-7

The book is devoted to the design and the analysis of so-called data correcting (DC) algorithms. A DC algorithm (typically applied to NP-hard optimization problems) is a branch-and-bound type algorithm, in which the input data are “heuristically corrected” at the various stages whereby two goals are pursued simultaneously. First, the modified input instance should belong to a (more) tractable subproblem. Second, the solution that is optimal for the corrected data should be within a prespecified (additive!) deviation from the solution that is optimal for the original data. The tools that are used in branch-and-bound algorithms and the additional tools used in DC algorithms work hand in hand. For instance, a data correction may allow for more excessive pruning (at the expense of another small additive deviation from optimality), or the branching element (plus data correction) can be chosen so as to get as close as possible to a tractable subproblem.

The book is organized as follows. In an introductory chapter, the DC approach is applied to realvalued functions (for illustrative purposes mainly) and to the Asymmetric Traveling Salesman Problem. Chapter 2 is concerned with the maximization of submodular functions. It presents theoretical results on the structure of local and global maxima and indicates how these results can be used for adding horsepower to the DC approach. It seems that many of these results were accessible before in Russian only (and some of them are entirely new). Chapter 3 presents the (full) DC algorithm for the maximization of submodular functions and explains howthe theoretical insights from Chapter 2 are reflected in its design. Chapter 4 applies the DC approach to the Simple Plant Location Problem (SPLP) thereby building on the pseudo-Boolean approach to the SPLP (due to P. Hammer). In this application, the DC algorithm is combined with a procedure that reduces the input instance to a smaller “core instance”. The book closes with a summary and finally points to some possible directions of future work. It should be mentioned that all central chapters of the book include experimental evaluations of the DC algorithms. The experimental results indicate that the DC approach is highly competitive to existing approaches, and often outperforms them.

The book should be of great interest to theoreticians and to practitioners. On one hand, it presents strong structural results (in particular the ones about submodular functions in Chapter 2), on the other hand it does a great job in algorithm engineering. The DC approach seems to come very close to a mature technology for (heuristically) solving a reasonably wide range of NP-hard combinatorial optimization problems.

Reviewed by Hans-Ulrich Simon

Copyright American Mathematical Society 2013

### Contents

Chapter 1 Introduction
| 1 |

Chapter 2 Maximization of Submodular Functions Theory and Algorithms
| 19 |

Chapter 3 Data Correcting Approach for the Maximization of Submodular Functions
| 45 |

Chapter 4 Data Correcting Approach for the Simple Plant Location Problem
| 79 |

Chapter 5 Summary
| 107 |

109 | |