Solving Network Design Problems via Decomposition, Aggregation and Approximation (PDF)
(Sprache: Englisch)
Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a...
sofort als Download lieferbar
eBook (pdf)
53.49 €
26 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Solving Network Design Problems via Decomposition, Aggregation and Approximation (PDF)“
Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time.
Contents
- Decomposition for Multi-Period Network Design
- Solving Network Design Problems via Aggregation
- Approximate Second-Order Cone Robust Optimization
Target Groups
- Researchers, teachers and students in mathematical optimization and operations research
- Network planners in the field of logistics and beyond
About the Author
Dr. Andreas Bärmann is currently working as a postdoctoral researcher at the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) at the chair of Economics, Discrete Optimization and Mathematics. His research is focussed on mathematical optimization, especially the optimization of logistic processes.
Autoren-Porträt von Andreas Bärmann
Dr. Andreas Bärmann is currently working as a postdoctoral researcher at the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) at the chair of Economics, Discrete Optimization and Mathematics. His research is focussed on mathematical optimization, especially the optimization of logistic processes.
Bibliographische Angaben
- Autor: Andreas Bärmann
- 2016, 1st ed. 2016, 203 Seiten, Englisch
- Verlag: Springer-Verlag GmbH
- ISBN-10: 3658139137
- ISBN-13: 9783658139131
- Erscheinungsdatum: 02.06.2016
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Größe: 4.51 MB
- Ohne Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kommentar zu "Solving Network Design Problems via Decomposition, Aggregation and Approximation"
0 Gebrauchte Artikel zu „Solving Network Design Problems via Decomposition, Aggregation and Approximation“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Solving Network Design Problems via Decomposition, Aggregation and Approximation".
Kommentar verfassen