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

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.

Publication Year: 2020
Imprint: Springer Fachmedien Wiesbaden
Format: P
Weight (Gram): 158