{"product_id":"solving-network-design-problems-via-decomposition-aggregation-and-approximation-9783658139124","title":"Solving Network Design Problems Via Decomposition, Aggregation and Approximation","description":"\u003cp\u003e • Author(s): Andreas Bärmann\u003cbr\u003e • Publisher: Springer\u003cbr\u003e • Publisher Imprint: Springer Spektrum\u003cbr\u003e • BISAC: Applied\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003cb\u003eFrom the Back Cover\u003c\/b\u003e\u003cbr\u003eAndreas 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.\u003cbr\u003e\u003cb\u003eContents\u003c\/b\u003e\u003c\/p\u003e\u003cul\u003e\n\u003cli\u003eDecomposition for Multi-Period Network Design\u003c\/li\u003e\n\u003cli\u003eSolving Network Design Problems via Aggregation\u003c\/li\u003e\n\u003cli\u003eApproximate Second-Order Cone Robust Optimization\u003c\/li\u003e\n\u003c\/ul\u003e\u003cb\u003eTarget Groups\u003c\/b\u003e\u003cul\u003e\n\u003cli\u003eResearchers, teachers and students in mathematical optimization and operations research\u003c\/li\u003e\n\u003cli\u003eNetwork planners in the field of logistics and beyond\u003c\/li\u003e\n\u003c\/ul\u003e\u003cb\u003eAbout the Author\u003c\/b\u003e\u003cb\u003eDr. Andreas Bärmann\u003c\/b\u003e 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.","brand":"Springer","offers":[{"title":"Paperback","offer_id":45277448241303,"sku":"9783658139124","price":3633.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0666\/3471\/1191\/files\/9783658139124.webp?v=1769288429","url":"https:\/\/atlanticbooks.com\/products\/solving-network-design-problems-via-decomposition-aggregation-and-approximation-9783658139124","provider":"Atlantic Books","version":"1.0","type":"link"}