A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization - Stefan Rocktäschel
-30% koodiga BOOKS
Saadetis 15-21 tööpäeva jooksul
30-päevane tagastamisõigus
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.
Võib-olla meeldib sulle ka
Kirjeldus
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.
Lisateave
| Autor | Stefan Rocktäschel |
|---|---|
| Kirjastaja | Springer Fachmedien Wiesbaden |
| Series | BestMasters |
| Väljalaskeaasta | 2020 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9783658291488 |