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
Ksh 8,100.00
Werezi Extended Catalogue
Delivery in 28 days
Delivery Location
Delivery fee: Select location
Delivery in 28 days
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.
