Cantitate/Preț
Produs
Total produse
Vezi coșul
Dynamic Programming Multi-Objective Combinatorial Optimization de Michal Mankowski

Dynamic Programming Multi-Objective Combinatorial Optimization: Studies in Systems, Decision and Control, cartea 331

Autor Michal Mankowski, Mikhail Moshkov
en Limba Engleză Paperback – 10 feb 2022
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.

Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 102307 lei  6-8 săpt.
  Springer International Publishing – 10 feb 2022 102307 lei  6-8 săpt.
Hardback (1) 102922 lei  6-8 săpt.
  Springer International Publishing – 9 feb 2021 102922 lei  6-8 săpt.

Din seria Studies in Systems, Decision and Control

Preț: 102307 lei

Preț vechi: 127884 lei
-20% Nou

Puncte Express: 1535
Preț estimativ în valută:
19579€ • 20398$ • 16279£

Carte tipărită la comandă

Livrare economică 08-22 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030639228
ISBN-10: 3030639223
Ilustrații: XIV, 214 p. 67 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.33 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seria Studies in Systems, Decision and Control

Locul publicării:Cham, Switzerland

Cuprins

Introduction.- Circuits Without Repetitions. Main Tools.- Combinatorial Optimization Problems. Conventional Circuits.- Multi-Stage and Bi-Criteria Optimization of Matchings in Trees.- Combinatorial Optimization Problems. Syntactical Circuits.- Index.

Recenzii

“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)

Textul de pe ultima copertă

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.

Caracteristici

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