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 ...
Read More
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.
Read Less
Add this copy of Dynamic Programming Multi-Objective Combinatorial to cart. $169.08, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2022 by Springer Nature Switzerland AG.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Contains: Illustrations, black & white. Studies in Systems, Decision and Control . XIV, 214 p. 67 illus. Intended for professional and scholarly audience.
Add this copy of Dynamic Programming Multi-Objective Combinatorial to cart. $169.08, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2021 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Sewn binding. Cloth over boards. 214 p. Contains: Unspecified, Illustrations, black & white. Studies in Systems, Decision and Control, 331.
Add this copy of Dynamic Programming Multi-Objective Combinatorial to cart. $193.87, new condition, Sold by Ria Christie Books rated 5.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2021 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. No dust jacket. Sewn binding. Cloth over boards. 214 p. Contains: Unspecified, Illustrations, black & white. Studies in Systems, Decision and Control, 331.
Add this copy of Dynamic Programming Multi-Objective Combinatorial to cart. $209.67, new condition, Sold by Media Smart rated 4.0 out of 5 stars, ships from Hawthorne, CA, UNITED STATES, published 2022 by Springer Nature Switzerland AG.
