Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331) - Tapa dura

Libro 288 de 378: Studies in Systems, Decision and Control

Mankowski, Michal; Moshkov, Mikhail

 
9783030639198: Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)
Tapa dura
ISBN 10: 3030639193 ISBN 13: 9783030639198
Editorial: Springer, 2021

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

De la contraportada

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2021
Idioma
Inglés
ISBN 10 
3030639193
ISBN 13 
9783030639198
Encuadernación
Tapa dura
Número de edición
1
Número de páginas
230
Contacto del fabricante
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3,69115 Heidelberg, Germany
Heidelberg
69115
Alemania

Otras ediciones populares con el mismo título

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

Edición Destacada

ISBN 10:  3030639223 ISBN 13:  9783030639228
Editorial: Springer, 2022
Tapa blanda