scientific article; zbMATH DE number 6913891

zbMATH Open1392.90119MaRDI QIDQ4577932FDOQ4577932

Authors: Hassan Rezapour, Gholam Hassan Shirdel 

Publication date: 6 August 2018

Full work available at URL: https://hrcak.srce.hr/ojs/index.php/crorr/article/view/4367

Title of this publication is not available (Why is that?)

Recommendations

• An approach to the shortest path problem with time-varying
• Time-dependent shortest paths with discounted waits
• Robust, almost constant time shortest-path queries in road networks
• Improved approximation for time-dependent shortest paths
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Time-varying shortest path problems with constraints
• Approximation solutions for time-varying shortest path problem
• Shortest paths in piecewise continuous time-dependent networks
• A finite-time algorithm for shortest path problems with time-varying costs
• Time-dependent shortest path problems with penalties and limits on waiting

zbMATH Keywords

robust optimizationshortest pathtime-varying network

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• Robust discrete optimization and network flows
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
• Constructing maximal dynamic flows from static flows
• Minimum weight paths in time-dependent networks
• A survey of dynamic network flows
• On solving continuous-time dynamic network flows
• Time-varying network optimization.
• Minimum cost time-varying network flow problems
• Time-varying shortest path problems with constraints
• Optimal flows in dynamic networks and algorithms for their finding
• Time-varying minimum cost flow problems
• Maximum flow problem on dynamic generative network flows with time-varying bounds
• The time-varying shortest path problem with fuzzy transit costs and speedup

Cited In (3)

• Approximation solutions for time-varying shortest path problem
• DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
• Optimising waiting at nodes in time-dependent networks: cost functions and applications

This page was built for publication:

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