Dynamic Programming Multi-Objective Combinatorial Optimization

TRAMA

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.

SOMMARIO

Introduction.- Circuits Without Repetitions. Main Tools.- Combinatorial Optimization Problems. Conventional Circuits.- Multi-Stage and Bi-Criteria Optimization of Matchings in Trees.- Combinatorial Optimization Problems. Syntactical Circuits.- Index.

ALTRE INFORMAZIONI

• Condizione: Nuovo
• ISBN: 9783030639198
• Collana: Studies in Systems, Decision and Control
• Dimensioni: 235 x 155 mm
• Formato: Copertina rigida
• Illustration Notes: XIV, 214 p. 67 illus.
• Pagine Arabe: 214
• Pagine Romane: xiv