"synopsis" may belong to another edition of this title.
"About this title" may belong to another edition of this title.
Seller: StainesBook, Weybridge, SURRE, United Kingdom
Condition: New. A brand new book in pristine condition. Showing zero signs of shelf wear, creases, or damage. Seller Inventory # SPRINGERNEW30289
Quantity: 1 available
Seller: Basi6 International, Irving, TX, U.S.A.
Condition: Brand New. New. Delivery takes 25-30 days. Excellent Customer Service. Seller Inventory # POD-287084
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Condition: new. Questo è un articolo print on demand. Seller Inventory # 486febdf8148e7864e593647849e0b90
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783030639198_new
Quantity: Over 20 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Considers extensions of dynamic programming for the study of multi-objective combinatorial optimization problemsProposes a fairly universal approach based on circuits without repetitions in which each eleme. Seller Inventory # 448686179
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 228 pp. Englisch. Seller Inventory # 9783030639198
Quantity: 2 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. 1st ed. 2021 edition NO-PA16APR2015-KAP. Seller Inventory # 26386905345
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand. Seller Inventory # 393743070
Quantity: 4 available
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Buch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 228 pp. Englisch. Seller Inventory # 9783030639198
Quantity: 1 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783030639198
Quantity: 1 available