Skip to main content
SpringerLink
Log in
Book cover

Data Correcting Approaches in Combinatorial Optimization

  • Book
  • © 2012

Overview

Authors:
  1. Boris Goldengorin

    1. Higher School of Economics, Dept. of Applied Math. & Informatics, National Research University, Nizhny Novgorod, Russia

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Panos M. Pardalos

    1. , Department of Industrial & Systems Engin, University of Florida, Gainesville, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • 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

Part of the book series: SpringerBriefs in Optimization (BRIEFSOPTI)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 49.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

  1. Front Matter

    Pages i-x
    Download chapter PDF

  2. Introduction

    • Boris Goldengorin, Panos M. Pardalos
    Pages 1-18

  3. Maximization of Submodular Functions: Theory and Algorithms

    • Boris Goldengorin, Panos M. Pardalos
    Pages 19-44

  4. Data Correcting Approach for the Maximization of Submodular Functions

    • Boris Goldengorin, Panos M. Pardalos
    Pages 45-77

  5. Data Correcting Approach for the Simple Plant Location Problem

    • Boris Goldengorin, Panos M. Pardalos
    Pages 79-106

  6. Summary

    • Boris Goldengorin, Panos M. Pardalos
    Pages 107-108

  7. Back Matter

    Pages 109-114
    Download chapter PDF
Back to top

Keywords

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

Authors and Affiliations

  • Higher School of Economics, Dept. of Applied Math. & Informatics, National Research University, Nizhny Novgorod, Russia

    Boris Goldengorin

  • , Department of Industrial & Systems Engin, University of Florida, Gainesville, USA

    Panos M. Pardalos

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation