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

Stefan Rocktäschel

ISBN 10: 3658291486 / ISBN 13: 9783658291488

Published by Springer Fachmedien Wiesbaden, Springer Fachmedien Wiesbaden Jan 2020, 2020

About this Item

Neuware -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.Springer Spektrum in Springer Science + Business Media, Tiergartenstr. 15-17, 69121 Heidelberg 80 pp. Englisch.

Seller Inventory # 9783658291488

Bibliographic Details

• Title: A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
• Publisher: Springer Fachmedien Wiesbaden, Springer Fachmedien Wiesbaden Jan 2020
• Publication Date: 2020
• Language: English
• ISBN 10: 3658291486
• ISBN 13: 9783658291488
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 210W x 148H x 5D millimeters 210 millimeters width by 148 millimeters height by 5 millimeters depth
• Weight: 131 grams

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.