Stefan Rocktäschel

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• BestMasters
• Verlag: Springer Fachmedien Wiesbaden / Springer Spektrum / Springer, Berlin
• Artikelnr. des Verlages: 978-3-658-29148-8
• 1st ed. 2020
• Seitenzahl: 80
• Erscheinungstermin: 22. Januar 2020
• Englisch
• Abmessung: 210mm x 148mm x 5mm
• Gewicht: 129g
• ISBN-13: 9783658291488
• ISBN-10: 3658291486
• Artikelnr.: 58437793

Autorenporträt

Stefan Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.

Inhaltsangabe

Theoretical basics for solving multiobjective mixed-integer convex optimization problems.- An algorithm for solving this class of optimization problems.- Test instances and numerical results.