| A Branch-And-Bound Algorithm for Multiobjective Mixed-Integer Convex Optimization 2020 Edition Contributor(s): Rocktäschel, Stefan (Author) |
|
 |
ISBN: 3658291486 ISBN-13: 9783658291488 Publisher: Springer Spektrum OUR PRICE: $52.24 Product Type: Paperback Published: January 2020 |
| Additional Information |
| BISAC Categories: - Mathematics | Applied - Mathematics | Counting & Numeration - Mathematics | Numerical Analysis |
| Physical Information: 70 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |