A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
| By: | Stefan Rocktäschel |
| Publisher: | Springer Nature |
| Print ISBN: | 9783658291488 |
| eText ISBN: | 9783658291495 |
| Edition: | 0 |
| Copyright: | 2020 |
| Format: | Page Fidelity |
Lifetime - $68.74
eBook Features
Instant Access
Purchase and read your book immediately
Read Offline
Access your eTextbook anytime and anywhere
Study Tools
Built-in study tools like highlights and more
Read Aloud
Listen and follow along as Bookshelf reads to you
Details
Table of Contents
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.