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.
Add this copy of Dynamic Programming Multi-Objective Combinatorial to cart. $179.46, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2022 by Springer Nature Switzerland AG.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Contains: Illustrations, black & white. Studies in Systems, Decision and Control . XIV, 214 p. 67 illus. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Dynamic Programming Multi-Objective Combinatorial to cart. $180.15, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2021 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Sewn binding. Cloth over boards. 214 p. Contains: Unspecified, Illustrations, black & white. Studies in Systems, Decision and Control, 331. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.