Work2008

SP-TAG: a routing algorithm in non-stationary transportation networks

3 citations0/0 files storedEAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous)

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Complexity and Algorithms in Graphs Data Management and Algorithms

Abstract

In a transportation network, the network topology and parameters can change with time, resulting in non-stationarity and time-dependent route preferences. Finding shortest routes is one of the most common queries on these time dependent networks. Developing efficient algorithms for computing shortes

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 3 citations exist upstream.

References

1986Urban transportation networks: Equilibrium analysis with mathematical programming methods 1999Handbook of Transportation Science

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.