Cargando…
Solving network design problems via decomposition, aggregation and approximation
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...
Autor principal: | Bärmann, Andreas |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
2016
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1007/978-3-658-13913-1 http://cds.cern.ch/record/2196710 |
Ejemplares similares
-
Hodge decomposition: a method for solving boundary value problems
por: Schwarz, Günter
Publicado: (1995) -
Potential function methods for approximately solving linear programming problems: theory and practice
por: Bienstock, Daniel
Publicado: (2002) -
Approximate analytical methods for solving ordinary differential equations
por: Radhika, TSL, et al.
Publicado: (2015) -
Stability, Approximation, and Decomposition in Two- and Multistage Stochastic Programming
por: Küchler, Christian
Publicado: (2009) -
Problem-solving through problems
por: Larson, Loren C
Publicado: (1983)