E-Book, Englisch, 70 Seiten, eBook
Reihe: BestMasters
Rocktäschel A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
1. Auflage 2020
ISBN: 978-3-658-29149-5
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
E-Book, Englisch, 70 Seiten, eBook
Reihe: BestMasters
ISBN: 978-3-658-29149-5
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
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.
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
Theoretical basics for solving multiobjective mixed-integer convex optimization problems.- An algorithm for solving this class of optimization problems.- Test instances and numerical results.