A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Stefan Rocktaschel
Springer Fachmedien Wiesbaden, 2020
66,50 €On orderDelivery: 2-3 weeks
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.
- ISBN-13
- 9783658291488
- ISBN-10
- 3658291486
- Publisher
- Springer Fachmedien Wiesbaden
- Year
- 2020
- Publication date
- 2020-01-22
- Pages
- 70
- Dimensions
- 149x210x7
- Weight
- 138