A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization - Stefan Rocktäschel
-25% koodilla BOOKS
Toimitus 15-21 arkipäivässä
30 päivän palautusoikeus
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.
Saatat myös pitää
Kuvaus
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.
Lisätietoja
| Kirjoittaja | Stefan Rocktäschel |
|---|---|
| Julkaisija | Springer Fachmedien Wiesbaden |
| Series | BestMasters |
| Julkaisuvuosi | 2020 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9783658291488 |