Cheapest paths in dynamic networks

DOI10.1002/NET.21714zbMath1390.90155OpenAlexW2539829685MaRDI QIDQ4565769

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

zbMATH Keywords

computational complexityshortest pathbranch and boundnetwork flowstime-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)

Related Items (2)

Determining time-dependent minimum cost paths under several objectives ⋮ An exact algorithm for a multicommodity min-cost flow over time problem

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