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.
Lieferbar
ISBN | 9783658291488 |
---|---|
Sprache | eng |
Cover | Kartonierter Einband (Kt) |
Verlag | Springer Fachmedien Wiesbaden |
Jahr | 20200122 |
Dieser Artikel hat noch keine Bewertungen.