Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Supporting your high street Find out how »
Dynamic Programming Multi-Objective Combinatorial Optimization, Paperback / softback Book

Dynamic Programming Multi-Objective Combinatorial Optimization Paperback / softback

Part of the Studies in Systems, Decision and Control series

Paperback / softback

Out of stock

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.

Information

Other Formats

£139.99

Out of stock
Add to Basket
Sign in to add to wishlist
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information