A fast algorithm for near cost optimal line plans
From MaRDI portal
Publication:1762670
DOI10.1007/s001860300332zbMath1138.90434MaRDI QIDQ1762670
Marco E. Lübbecke, Thomas Lindner, Michael R. Bussieck
Publication date: 11 February 2005
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15484
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C30: Nonlinear programming
90B06: Transportation, logistics and supply chain management
Related Items
Line planning on tree networks with applications to the Quito Trolebús system, Integrating train service route design with passenger flow allocation for an urban rail transit line, Train stop scheduling problem: an exact approach using valid inequalities and polar duality, Line planning in public transportation: models and methods, The line planning routing game, An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem, How to optimize train stops under diverse passenger demand: a new line planning method for large-scale high-speed rail networks, Urban public transit network optimization with flexible demand, The Steiner connectivity problem, COLUMN GENERATION APPROACH TO LINE PLANNING WITH VARIOUS HALTING PATTERNS — APPLICATION TO THE KOREAN HIGH-SPEED RAILWAY
Uses Software
