The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms

DOI<259::AID-NET6>3.0.CO;2-C 10.1002/(SICI)1097-0037(199807)31:4<259::AID-NET6>3.0.CO;2-CzbMath1002.90077OpenAlexW1998302192MaRDI QIDQ4540052

Shivaram Subramanian, Hanif D. Sherali, Kaan M. A. Özbay

Publication date: 21 July 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199807)31:4<259::aid-net6>3.0.co;2-c

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (7)

Multicriteria movement synchronization scheduling problems and algorithms ⋮ Distance oracles for time-dependent networks ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Data-driven approaches for emissions-minimized paths in urban areas ⋮ On the complexity of time-dependent shortest paths ⋮ OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS ⋮ An axiomatic approach to time-dependent shortest path oracles

Uses Software

• CPLEX

This page was built for publication: The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms