A Branch-And-Bound Algorithm for Multiobjective Mixed-Integer Convex Optimization

By Stefan Rocktäschel

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.

• Format: Paperback
• Language: English
• ISBN: 3658291486
• ISBN13: 9783658291488
• Release Date: January 2020
• Publisher: Springer Spektrum
• Length: 70 Pages