Solving network design problems via decomposition, aggregation and approximation. With an application to the optimal expansion of railway infrastructure

DOI10.1007/978-3-658-13913-1zbMATH Open1338.90002OpenAlexW2788207202MaRDI QIDQ2804575FDOQ2804575

Authors: Andreas Bärmann 

Publication date: 4 May 2016

Full work available at URL: https://doi.org/10.1007/978-3-658-13913-1

Recommendations

• An optimal expansion strategy for the German railway network until 2030
• Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
• GRASP algorithms for the robust railway network design problem
• scientific article; zbMATH DE number 1086913
• Urban rapid transit network design: accelerated Benders decomposition

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Applications of mathematical programming (90C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Transportation, logistics and supply chain management (90B06)

Cited In (5)

• Optimization for L₁-Norm Error Fitting via Data Aggregation
• The complexity of the timetable‐based railway network design problem
• Solving network design problems via iterative aggregation
• An optimal expansion strategy for the German railway network until 2030
• GRASP algorithms for the robust railway network design problem

This page was built for publication: Solving network design problems via decomposition, aggregation and approximation. With an application to the optimal expansion of railway infrastructure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804575)