A word in response to the corona virus crisis: Your print orders will be fulfilled, even in these challenging times. If you don’t want to wait – have a look at our ebook offers and start reading immediately.

BestMasters

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

Authors: Rocktäschel, Stefan

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

Buy this book

eBook 46,00 €
price for Spain (gross)
  • ISBN 978-3-658-29149-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 57,19 €
price for Spain (gross)
  • ISBN 978-3-658-29148-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
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.

About the authors

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

Table of contents (7 chapters)

Table of contents (7 chapters)

Buy this book

eBook 46,00 €
price for Spain (gross)
  • ISBN 978-3-658-29149-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 57,19 €
price for Spain (gross)
  • ISBN 978-3-658-29148-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Authors
Series Title
BestMasters
Copyright
2020
Publisher
Springer Spektrum
Copyright Holder
Springer Fachmedien Wiesbaden GmbH, part of Springer Nature
eBook ISBN
978-3-658-29149-5
DOI
10.1007/978-3-658-29149-5
Softcover ISBN
978-3-658-29148-8
Series ISSN
2625-3577
Edition Number
1
Number of Pages
VIII, 70
Number of Illustrations
15 b/w illustrations
Topics