Dynamic Programming Multi-Objective Combinatorial Optimization (Studies in Systems, Decision and Control, 331) de Mankowski, Michal, Moshkov, Mikhail: New Hardcover (2021)

Descripci�n

New.

N� de ref. del art�culo D8F0-0-M-3030639193-6

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Dynamic Programming Multi-Objective Combinatorial Optimization (Studies in Systems, Decision and Control, 331)
Editor: Springer
Fecha de publicaci�n: 2021
Idioma: Ingl�s
ISBN 10: 3030639193
ISBN 13: 9783030639198
Encuadernaci�n: Hardcover
Estado: New
Tipo de libro: book

Acerca de

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.

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.