BestMasters / A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
(Sprache: Englisch)
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...
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
53.49 €
26 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „BestMasters / A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization “
Klappentext zu „BestMasters / A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization “
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.
Inhaltsverzeichnis zu „BestMasters / A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization “
Theoretical basics for solving multiobjective mixed-integer convex optimization problems.- An algorithm for solving this class of optimization problems.- Test instances and numerical results.
Autoren-Porträt von Stefan Rocktäschel
Stefan Rocktäschel works as scientific assistant at the Institute for Mathematics of Technische Universität Ilmenau, Germany.
Bibliographische Angaben
- Autor: Stefan Rocktäschel
- 2020, 1st ed. 2020, VIII, 70 Seiten, Maße: 14,8 x 21 cm, Kartoniert (TB), Englisch
- Verlag: Springer, Berlin
- ISBN-10: 3658291486
- ISBN-13: 9783658291488
Sprache:
Englisch
Kommentar zu "BestMasters / A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization"
0 Gebrauchte Artikel zu „BestMasters / A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "BestMasters / A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization".
Kommentar verfassen