Solving Network Design Problems via Decomposition, Aggregation and Approximation
Andreas Barmann
€ 66.30
FREE Delivery in Ireland
Description for Solving Network Design Problems via Decomposition, Aggregation and Approximation
Paperback. Num Pages: 218 pages, 4 black & white illustrations, 28 colour illustrations, 30 colour tables, biography. BIC Classification: GPFC; PBW. Category: (G) General (US: Trade). Dimension: 240 x 168 x 12. Weight in Grams: 380.
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 ... Read more
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 ... Read more
Product Details
Format
Paperback
Publication date
2016
Publisher
Springer Fachmedien Wiesbaden Germany
Number of pages
218
Condition
New
Number of Pages
203
Place of Publication
Weisbaden, Germany
ISBN
9783658139124
SKU
V9783658139124
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
About Andreas Barmann
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.
Reviews for Solving Network Design Problems via Decomposition, Aggregation and Approximation