Overview
- First algorithm for solving multiobjective mixed-integer convex optimization problems
Part of the book series: BestMasters (BEST)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
Table of contents (7 chapters)
Authors and Affiliations
About the author
Stefan Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.
Bibliographic Information
Book Title: A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Authors: Stefan Rocktäschel
Series Title: BestMasters
DOI: https://doi.org/10.1007/978-3-658-29149-5
Publisher: Springer Spektrum Wiesbaden
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer Fachmedien Wiesbaden GmbH, part of Springer Nature 2020
Softcover ISBN: 978-3-658-29148-8Published: 22 January 2020
eBook ISBN: 978-3-658-29149-5Published: 21 January 2020
Series ISSN: 2625-3577
Series E-ISSN: 2625-3615
Edition Number: 1
Number of Pages: VIII, 70
Number of Illustrations: 15 b/w illustrations
Topics: Applications of Mathematics, Computational Mathematics and Numerical Analysis