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...
Κύριος συγγραφέας: | Bärmann, Andreas (Συγγραφέας) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Wiesbaden :
Springer Fachmedien Wiesbaden : Imprint: Springer Spektrum,
2016.
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Invexity and Optimization
ανά: Mishra, Shashi Kant, κ.ά.
Έκδοση: (2008) -
Quadratic Programming and Affine Variational Inequalities A Qualitative Study /
ανά: Lee, Gue Myung, κ.ά.
Έκδοση: (2005) -
Single-Facility Location Problems with Barriers
ανά: Klamroth, Kathrin
Έκδοση: (2002) -
Potential Function Methods for Approximately Solving Linear Programming Problems Theory and Practice /
ανά: Bienstock, Daniel
Έκδοση: (2002) -
Variable Ordering Structures in Vector Optimization
ανά: Eichfelder, Gabriele
Έκδοση: (2014)