Dynamic graph generation for the shortest path problem in time expanded networks

DOI10.1007/s10107-012-0610-3zbMath1303.90116MaRDI QIDQ2436645

Christoph Helmberg, Frank Fischer

Publication date: 25 February 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0610-3

zbMATH Keywords

shortest path; large scale optimization; corridor; dynamic graph generation; time expanded networks

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C06: Large-scale problems in mathematical programming

90B10: Deterministic network models in operations research

Uses Software

• ConicBundle