A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
2020 ed.
Book Details
Format
Paperback / Softback
Book Series
BestMasters
ISBN-10
3658291486
ISBN-13
9783658291488
Edition
2020 ed.
Publisher
Springer Fachmedien Wiesbaden
Imprint
Springer Spektrum
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Jan 22nd, 2020
Print length
70 Pages
Weight
138 grams
Dimensions
14.90 x 21.00 x 0.70 cms
Product Classification:
Numerical analysisApplied mathematics
AI Summary
Ksh 4,150.00
Werezi Extended Catalogue
0 in stock
Delivery Location
Delivery fee: Select location
Secure
Quality
Fast
Stefan Rocktäschel introduces a branch-and-bound algorithm that determines a cover of the efficient set of multiobjective mixed-integer convex optimization problems. He examines particular steps of this algorithm in detail and enhances the basic algorithm with additional modifications that ensure a more precise cover of the efficient set.
Get A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Springer Fachmedien Wiesbaden and it has pages.
Discover books you might love based on this title.
More in This Genre
Upscaling of Single- and Two-Phase Flow in Reservoir Engineering
Ksh 8,800.00
Accelerator Programming Using Directives
Ksh 8,100.00
Mathematical Methods for Engineering Applications
Ksh 23,650.00
Mechanical and Solid-Fluid Operations, 3-volume set
Ksh 84,600.00
Nonlinear Waves in Elastic Crystals
Ksh 14,250.00
Model Order Reduction Techniques with Applications in Finite Element Analysis
Ksh 17,800.00
