The approach‐dependent, time‐dependent, label‐constrained shortest path problem

DOI10.1002/net.20120zbMath1103.90049OpenAlexW4234243195MaRDI QIDQ5487812

Chawalit Jeenanunta, Antoine G. Hobeika, Hanif D. Sherali

Publication date: 12 September 2006

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

time dependentshortest path problemsTRANSIMSlabel constraintsapproach dependent

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (2)

Data-driven approaches for emissions-minimized paths in urban areas ⋮ Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks

Uses Software

• TRANSIMS

Cites Work

• Unnamed Item

This page was built for publication: The approach‐dependent, time‐dependent, label‐constrained shortest path problem