Approximation solutions for time-varying shortest path problem

DOI10.22049/CCO.2017.25850.1047MaRDI QIDQ4598311zbMATH OpenOpenAlexFDO

Authors Hassan Rezapour, Gholam Hassan Shirdel

Publication date 20 December 2017

Full work available at URL http://comb-opt.azaruniv.ac.ir/article_13645_0d39e0bfe8ae0a66991a25e4ac1ac564.pdf

zbMATH Keywords

approximation solutionsshortest path problemtime-varying optimization

Mathematics Subject Classification ID

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

Recommendations

• An approach to the shortest path problem with time-varying
• scientific article; zbMATH DE number 6913891
• Time-varying network optimization.
• Improved approximation for time-dependent shortest paths
• Time-varying shortest path problems with constraints

Cited in

(6)

• Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
• Improved approximation for time-dependent shortest paths
• An approach to the shortest path problem with time-varying
• Time-varying shortest path problem with curfews
• Efficient modeling of travel in networks with time-varying link speeds
• scientific article; zbMATH DE number 6913891 (Why is no real title available?)

This page was built for publication: Approximation solutions for time-varying shortest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598311)