Skip to main content
SpringerLink
Log in

Dynamic Programming Multi-Objective Combinatorial Optimization

  • Book
  • © 2021

Overview

Authors:
  1. Michal Mankowski

    1. Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Mikhail Moshkov

    1. Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Considers extensions of dynamic programming for the study of multi-objective combinatorial optimization problems
  • Proposes a fairly universal approach based on circuits without repetitions in which each element is generated exactly one time
  • Is useful for researchers in combinatorial optimization

Part of the book series: Studies in Systems, Decision and Control (SSDC, volume 331)

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 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 179.99
Price excludes VAT (USA)
  • Durable hardcover 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 (19 chapters)

  1. Front Matter

    Pages i-xiv
    Download chapter PDF

  2. Introduction

    • Michal Mankowski, Mikhail Moshkov
    Pages 1-14

  3. Circuits Without Repetitions. Main Tools

    1. Front Matter

      Pages 15-15
      Download chapter PDF

    2. Circuits and Cost Functions

      • Michal Mankowski, Mikhail Moshkov
      Pages 17-27

    3. Multi-Stage Optimization and Counting Optimal Elements

      • Michal Mankowski, Mikhail Moshkov
      Pages 29-34

    4. Bi-Criteria Optimization of Elements

      • Michal Mankowski, Mikhail Moshkov
      Pages 35-47

  4. Combinatorial Optimization Problems. Conventional Circuits

    1. Front Matter

      Pages 49-49
      Download chapter PDF

    2. Matrix Chain Multiplication

      • Michal Mankowski, Mikhail Moshkov
      Pages 51-62

    3. Global Sequence Alignment

      • Michal Mankowski, Mikhail Moshkov
      Pages 63-73

    4. Optimal Paths in Directed Graphs

      • Michal Mankowski, Mikhail Moshkov
      Pages 75-86

    5. Binary Search Trees

      • Michal Mankowski, Mikhail Moshkov
      Pages 87-97

    6. Convex Polygon Triangulation

      • Michal Mankowski, Mikhail Moshkov
      Pages 99-109

    7. Line Breaking

      • Michal Mankowski, Mikhail Moshkov
      Pages 111-122

    8. One-Dimensional Clustering

      • Michal Mankowski, Mikhail Moshkov
      Pages 123-133

    9. Optimal Bitonic Tour

      • Michal Mankowski, Mikhail Moshkov
      Pages 135-145

    10. Segmented Least Squares

      • Michal Mankowski, Mikhail Moshkov
      Pages 147-156

  5. Multi-Stage and Bi-Criteria Optimization of Matchings in Trees

    1. Front Matter

      Pages 157-157
      Download chapter PDF

    2. Discussion of Matching Optimization Problem and Representation of Matchings

      • Michal Mankowski, Mikhail Moshkov
      Pages 159-164

    3. Counting Matchings and Multi-Stage Optimization of Matchings

      • Michal Mankowski, Mikhail Moshkov
      Pages 165-172

    4. Bi-Criteria Optimization of Matchings

      • Michal Mankowski, Mikhail Moshkov
      Pages 173-178
Back to top

Keywords

About this book

This book introduces a fairly universal approach to the design and analysis of exact optimization algorithms for multi-objective combinatorial optimization problems. It proposes the circuits without repetitions representing the sets of feasible solutions along with the increasing and strictly increasing cost functions as a model for such problems. The book designs the algorithms for multi-stage and bi-criteria optimization and for counting the solutions in the framework of this model.


As applications, this book studies eleven known combinatorial optimization problems: matrix chain multiplication, global sequence alignment, optimal paths in directed graphs, binary search trees, convex polygon triangulation, line breaking (text justification), one-dimensional clustering, optimal bitonic tour, segmented least squares, optimization of matchings in trees, and 0/1 knapsack problem.


The results presented are useful for researchers in combinatorial optimization. This book is also useful as the basis for graduate courses.


Reviews

“Each chapter has its own reference list. It is noteworthy that much of the material presented here has previously been published by the authors and other collaborators in journal papers. The book thus presents this work within a unified framework, which makes the work of the authors more accessible to other researchers.” (Matthias Ehrgott, Mathematical Reviews, May, 2022)

Authors and Affiliations

  • Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia

    Michal Mankowski, Mikhail Moshkov

Bibliographic Information

  • Book Title: Dynamic Programming Multi-Objective Combinatorial Optimization

  • Authors: Michal Mankowski, Mikhail Moshkov

  • Series Title: Studies in Systems, Decision and Control

  • DOI: https://doi.org/10.1007/978-3-030-63920-4

  • Publisher: Springer Cham

  • eBook Packages: Intelligent Technologies and Robotics, Intelligent Technologies and Robotics (R0)

  • Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021

  • Hardcover ISBN: 978-3-030-63919-8Published: 09 February 2021

  • Softcover ISBN: 978-3-030-63922-8Published: 10 February 2022

  • eBook ISBN: 978-3-030-63920-4Published: 08 February 2021

  • Series ISSN: 2198-4182

  • Series E-ISSN: 2198-4190

  • Edition Number: 1

  • Number of Pages: XIV, 214

  • Number of Illustrations: 67 b/w illustrations

  • Topics: Computational Intelligence, Programming Techniques

Publish with us

Policies and ethics

Back to top

Search

Navigation