Dynamic Programming Multi-Objective Combinatorial Optimization (Hardcover, 1st ed. 2021)

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.

General

Imprint:	Springer Nature Switzerland AG
Country of origin:	Switzerland
Series:	Studies in Systems, Decision and Control, 331
Release date:	February 2021
First published:	2021
Authors:	Michal Mankowski • Mikhail Moshkov
Dimensions:	235 x 155mm (L x W)
Format:	Hardcover
Pages:	214
Edition:	1st ed. 2021
ISBN-13:	978-3-03-063919-8
Categories:	Books > Computing & IT > Computer programming > General Books > Computing & IT > Applications of computing > Artificial intelligence > General Promotions
LSN:	3-03-063919-3
Barcode:	9783030639198

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!