Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Solving Network Design Problems Via Decomposition, Aggregation and Approximation

by Andreas Bärmann
Save 35% Save 35%
Current price ₹3,633.00
Original price ₹5,589.00
Original price ₹5,589.00
Original price ₹5,589.00
(-35%)
₹3,633.00
Current price ₹3,633.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9783658139124
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Springer
  • Publisher Imprint: Springer Spektrum
  • Publication Date:
  • Pages: 203
  • Original Price: EUR 49.99
  • Language: English
  • Edition: 2016
  • Item Weight: 375 grams
  • BISAC Subject(s): Applied, Operations Research, and Production & Operations Management

From the Back Cover
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 AuthorDr. 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.

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.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us