Branch and bound algorithm multiobjective mixed integer von rocktäschel stefan (2 Ergebnisse)

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Taschenbuch. Zustand: Neu. A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization | Stefan Rocktäschel | Taschenbuch | BestMasters | viii | Englisch | 2020 | Springer VS | EAN 9783658291488 | Verantwortliche Person für die EU: Springer Spektrum in Springer Science + Business Media, Tiergartenstr. 15-17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…