Trending Bestseller

Dynamic Programming Multi-Objective Combinatorial Optimization

No reviews yet Write a Review
Hardback
09 February 2021
RRP: $284.91
$280.64
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:
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.
Product Details
ISBN-13
9783030639198
Author
Michal Mankowski
Publisher
Springer Nature B.V.
Published
09 February 2021
Format
Hardback

This product hasn't received any reviews yet. Be the first to review this product!

RRP: $284.91
$280.64
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:

Dynamic Programming Multi-Objective Combinatorial Optimization

RRP: $284.91
$280.64

Description

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.