Skip to main content
SpringerLink
Log in
Book cover

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

  • Book
  • © 2020

Overview

Authors:
  1. Stefan Rocktäschel

    1. Ilmenau, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • First algorithm for solving multiobjective mixed-integer convex optimization problems

Part of the book series: BestMasters (BEST)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. Introduction

    • Stefan Rocktäschel
    Pages 1-3

  3. Theoretical Basics

    • Stefan Rocktäschel
    Pages 5-15

  4. A basic Branch-and-Bound algorithm for (MOMICP)

    • Stefan Rocktäschel
    Pages 17-39

  5. Enhancing Algorithm 1

    • Stefan Rocktäschel
    Pages 41-49

  6. Test instances and numerical results

    • Stefan Rocktäschel
    Pages 51-59

  7. Outlook and further possible improvements

    • Stefan Rocktäschel
    Pages 61-62

  8. Conclusion

    • Stefan Rocktäschel
    Pages 63-63

  9. Back Matter

    Pages 65-70
    Download chapter PDF
Back to top

Keywords

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.

Authors and Affiliations

  • Ilmenau, Germany

    Stefan Rocktäschel

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

Publish with us

Policies and ethics

Back to top

Search

Navigation