Cheapest paths in dynamic networks

DOI10.1002/NET.21714zbMATH Open1390.90155OpenAlexW2539829685MaRDI QIDQ4565769FDOQ4565769

Enrico Grande, Andrea Pacifici, Marco di Bartolomeo, Gaia Nicosia

Publication date: 13 June 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21714

Recommendations

• Minimum cost paths over dynamic networks
• scientific article; zbMATH DE number 1783111
• Shortest-path algorithms and dynamic cost changes
• Shortest paths on dynamic graphs
• Dynamic shortest paths minimizing travel times and costs
• Minimum Cost Routing on Stochastic Networks
• On dynamic shortest paths problems
• Algorithms – ESA 2004
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS

zbMATH Keywords

computational complexitynetwork flowsshortest pathbranch and boundtime-dependent networkstime-expanded networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Cited In (7)

• Determining time-dependent minimum cost paths under several objectives
• Dynamic shortest paths minimizing travel times and costs
• Title not available (Why is that?)
• Short-length routes in low-cost networks via Poisson line patterns
• Finding cheapest deadline paths
• Title not available (Why is that?)
• An exact algorithm for a multicommodity min-cost flow over time problem

This page was built for publication: Cheapest paths in dynamic networks

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