Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Price for Eshop: 1267 Kč (€ 50.7)
VAT 0% included
New
E-book delivered electronically online
E-Book information
Annotation
Stefan Rocktaschel 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. Finally, he gives numerical results on some test instances.
Ask question
You can ask us about this book and we'll send an answer to your e-mail.