SpringerBriefs in Optimization

Data Correcting Approaches in Combinatorial Optimization

Authors: Goldengorin, Boris, Pardalos, Panos M.

  • ​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
see more benefits

Buy this book

eBook $34.99
price for USA (gross)
  • ISBN 978-1-4614-5286-7
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $49.95
price for USA
  • ISBN 978-1-4614-5285-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
About this book

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

Reviews

[The book] 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 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."

—Hans-Ulrich Simon , Mathematical Reviews


Table of contents (5 chapters)

  • Introduction

    Goldengorin, Boris (et al.)

    Pages 1-18

  • Maximization of Submodular Functions: Theory and Algorithms

    Goldengorin, Boris (et al.)

    Pages 19-44

  • Data Correcting Approach for the Maximization of Submodular Functions

    Goldengorin, Boris (et al.)

    Pages 45-77

  • Data Correcting Approach for the Simple Plant Location Problem

    Goldengorin, Boris (et al.)

    Pages 79-106

  • Summary

    Goldengorin, Boris (et al.)

    Pages 107-108

Buy this book

eBook $34.99
price for USA (gross)
  • ISBN 978-1-4614-5286-7
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $49.95
price for USA
  • ISBN 978-1-4614-5285-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Data Correcting Approaches in Combinatorial Optimization
Authors
Series Title
SpringerBriefs in Optimization
Copyright
2012
Publisher
Springer-Verlag New York
Copyright Holder
Boris Goldengorin, Panos M. Pardalos
eBook ISBN
978-1-4614-5286-7
DOI
10.1007/978-1-4614-5286-7
Softcover ISBN
978-1-4614-5285-0
Series ISSN
2190-8354
Edition Number
1
Number of Pages
X, 114
Number of Illustrations and Tables
41 b/w illustrations
Topics