Solving Network Design Problems via Decomposition, Aggregation and Approximation (Paperback, 1st ed. 2016)

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

Imprint:	Springer Spektrum
Country of origin:	Germany
Release date:	June 2016
First published:	2016
Authors:	Andreas Barmann
Dimensions:	240 x 168 x 12mm (L x W x T)
Format:	Paperback
Pages:	203
Edition:	1st ed. 2016
ISBN-13:	978-3-658-13912-4
Categories:	Books > Reference & Interdisciplinary > Communication studies > Information theory > Cybernetics & systems theory Books > Science & Mathematics > Mathematics > Applied mathematics > General Promotions
LSN:	3-658-13912-9
Barcode:	9783658139124

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!