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

Rocktäschel, Stefan

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.

Details

Published by: Springer Spektrum

Publication Date: 2020-01-22

Format: Paperback

ISBN-13: 9783658291488

DOI: 10.1007/978-3-658-29149-5

Dimensions: 210.0cm x148.0cm

Pages: 70.0