Contact
How to shop
Delivery
Shopping guide
Solving Network Design Problems via Decomposition, Aggregation and Approximation
English
125 b
Up to 30 days for returns
Customers also purchased
/
Paperback
12 723
Ft
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.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Hardback
35 208
Ft
/
Hardback
88 954
Ft
/
Paperback
6 510
Ft
/
Paperback
2 634
Ft
Hi! I'm Libroamiko, your book advisor.
How can I help you?