A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization - Stefan Rocktäschel
-25% su kodu BOOKS
Pristatymas per 15-21 d.d.
30 dienų grąžinimo politika
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. Finally, he gives numerical results on some test instances.
Jums taip pat gali patikti
Aprašymas
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. Finally, he gives numerical results on some test instances.
Daugiau informacijos
| Autorius | Stefan Rocktäschel |
|---|---|
| Leidėjas | Springer Fachmedien Wiesbaden |
| Series | BestMasters |
| Išleidimo metai | 2020 |
| Viršelio tipas | Minkšti viršeliai |
| EAN | 9783658291488 |