Download or read book A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization written by Stefan Rocktäschel and published by Springer Nature. This book was released on 2020-01-21 with total page 72 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.