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...
| Main Author: | Bärmann, Andreas (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Wiesbaden :
Springer Fachmedien Wiesbaden : Imprint: Springer Spektrum,
2016.
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Invexity and Optimization
by: Mishra, Shashi Kant, et al.
Published: (2008) -
Feasibility and Infeasibility in Optimization Algorithms and Computational Methods /
by: Chinneck, John W.
Published: (2008) -
Single-Facility Location Problems with Barriers
by: Klamroth, Kathrin
Published: (2002) -
Potential Function Methods for Approximately Solving Linear Programming Problems Theory and Practice /
by: Bienstock, Daniel
Published: (2002) -
Quadratic Programming and Affine Variational Inequalities A Qualitative Study /
by: Lee, Gue Myung, et al.
Published: (2005)