Electronic Resource

Dynamic Programming Multi-Objective Combinatorial Optimization

---

Penilaian

---

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.

---

Availability

Inventory Code	Barcode	Call Number	Location	Status
1908001317	EB0001923	519.64 Man d	Central Library (OPAC)	Available

Detail Information

Series Title

-

Call Number

519.64 Man d

Publisher

Switzerland : Springer Cham., 2021

Collation

xiv, 214p.:Ill

Language

English

ISBN/ISSN

978-3-030-63920-4

Classification

519.64

Content Type

Ebook

Media Type

-

Carrier Type

online resource

Edition

1

Subject(s)

Dynamic Programming

Specific Detail Info

-

Statement of Responsibility

BRF

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment