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

Rocktäschel, Stefan

ISBN 10: 3658291486 / ISBN 13: 9783658291488

Published by Springer, 2020

About this Item

pp. 78.

Seller Inventory # 26380616358

Bibliographic Details

• Title: A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (BestMasters)
• Publisher: Springer
• Publication Date: 2020
• Language: English
• ISBN 10: 3658291486
• ISBN 13: 9783658291488
• Binding: Soft cover
• Condition: New

About this title

Synopsis

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.

About the Author

Stefan Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.