Dynamic shortest path problems with time-varying costs
type: Item
instance of: scholarly article
title: Dynamic shortest path problems with time-varying costs
zbMATH Open document ID: 1181.90047
author: S. Mehdi Hashemi
author: Shaghayegh Mokarami
author: Ebrahim Nasrabadi
published in: Optimization Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5664378
zbMATH Keywords: time-varying networks
zbMATH Keywords: labeling algorithms
MaRDI profile type: Publication
full work available at URL: s11590-009-0162-5
OpenAlex ID: W1996702143
cites work: Q3056948
cites work: Dynamic shortest paths minimizing travel times and costs
cites work: Time-varying shortest path problems with constraints
cites work: The shortest route through a network with time-dependent internodal transit times
cites work: Negative-cycle detection algorithms
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: Q3086028
cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
cites work: Minimum weight paths in time-dependent networks
cites work: Q4495163
cites work: Continuous-time shortest path problems with stopping and starting costs
cites work: A finite-time algorithm for shortest path problems with time-varying costs
cites work: Continuous-Time Shortest Path Problems and Linear Programming
DOI: 10.1007/S11590-009-0162-5
description: scientific article; zbMATH DE number 5664378