Atnaujintas knygų su minimaliais defektais pasiūlymas! Naršykite ČIA >>

Solving Network Design Problems via Decomposition, Aggregation and Approximation

-15% su kodu: ENG15
71,98 
Įprasta kaina: 84,68 
-15% su kodu: ENG15
Kupono kodas: ENG15
Akcija baigiasi: 2025-03-03
-15% su kodu: ENG15
71,98 
Įprasta kaina: 84,68 
-15% su kodu: ENG15
Kupono kodas: ENG15
Akcija baigiasi: 2025-03-03
-15% su kodu: ENG15
2025-02-28 84.6800 InStock
Nemokamas pristatymas į paštomatus per 11-15 darbo dienų užsakymams nuo 10,00 

Knygos aprašymas

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.

Informacija

Autorius: Andreas Bärmann
Leidėjas: Springer Fachmedien Wiesbaden
Išleidimo metai: 2016
Knygos puslapių skaičius: 220
ISBN-10: 3658139129
ISBN-13: 9783658139124
Formatas: 240 x 168 x 13 mm. Knyga minkštu viršeliu
Kalba: Anglų

Pirkėjų atsiliepimai

Parašykite atsiliepimą apie „Solving Network Design Problems via Decomposition, Aggregation and Approximation“

Būtina įvertinti prekę

Goodreads reviews for „Solving Network Design Problems via Decomposition, Aggregation and Approximation“