A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
From MaRDI portal
Publication:1626744
DOI10.1007/978-3-319-93031-2_21OpenAlexW2807088699MaRDI QIDQ1626744
Edward He, Natashia Boland, Savelsbergh, Martin W. P., Nemhauser, George I.
Publication date: 21 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-93031-2_21
Related Items
Ant colony optimization algorithms with diversified search in the problem of optimization of airtravel itinerary ⋮ A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem ⋮ An iterative graph expansion approach for the scheduling and routing of airplanes ⋮ Branch-and-refine for solving time-expanded MILP formulations