Solving Network Design Problems via Decomposition, Aggregation and Approximation

• Κύριος συγγραφέας: Bärmann, Andreas (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Wiesbaden : Springer Fachmedien Wiesbaden : Imprint: Springer Spektrum, 2016.
• Θέματα: Mathematics.; Business logistics.; Operations research.; Decision making.; Mathematical optimization.; Optimization.; Operation Research/Decision Theory.; Logistics.

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...

Πίνακας περιεχομένων:

• Decomposition for Multi-Period Network Design
• Solving Network Design Problems via Aggregation
• Approximate Second-Order Cone Robust Optimization.