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.
| ISBN: | 9783658291488 |
| Publication date: | 22nd January 2020 |
| Author: | Stefan Rocktäschel |
| Publisher: | Springer Spektrum an imprint of Springer Fachmedien Wiesbaden |
| Format: | Paperback |
| Pagination: | 70 pages |
| Series: | BestMasters |
| Genres: |
Applied mathematics Numerical analysis |
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.
A Branch-and-Bound Algorithm for Multiobjective Mixed-Integer Convex Optimization features in the following genres: Applied mathematics, Numerical analysis
Paperback. £40.49, down from the £44.99 cover price. Not Available.
A Branch-and-Bound Algorithm for Multiobjective Mixed-Integer Convex Optimization was written by Stefan Rocktäschel and published by Springer Spektrum an imprint of Springer Fachmedien Wiesbaden
A Branch-and-Bound Algorithm for Multiobjective Mixed-Integer Convex Optimization has 70 pages
Yes it is part of BestMasters series
£40.49, reduced from £44.99. Not Available.