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. 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.
Price: 334 AUD
Location: Hillsdale, NSW
End Time: 2024-11-05T03:08:49.000Z
Shipping Cost: 32.92 AUD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 60 Days
Return policy details:
EAN: 9783030639228
UPC: 9783030639228
ISBN: 9783030639228
MPN: N/A
Format: Paperback, 214 pages, 2021 Edition
Author: Moshkov, Mikhail
Book Title: Dynamic Programming Multi-Objective Combinatorial
Item Height: 1.2 cm
Item Length: 23.4 cm
Item Weight: 0.36 kg
Item Width: 15.6 cm
Language: Eng
Publisher: Springer
