|
Books > Reference & Interdisciplinary > Communication studies > Information theory > Cybernetics & systems theory
|
Buy Now
Solving Network Design Problems via Decomposition, Aggregation and Approximation (Paperback, 1st ed. 2016)
Loot Price: R2,208
Discovery Miles 22 080
|
|
|
Solving Network Design Problems via Decomposition, Aggregation and Approximation (Paperback, 1st ed. 2016)
Expected to ship within 10 - 15 working days
|
Andreas Barmann 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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
