Computation of the optimal value function in time-dependent networks

DOI10.1002/NET.21501zbMATH Open1338.90081OpenAlexW1971343470MaRDI QIDQ2811299FDOQ2811299

Authors: Sebastian Kluge, Konrad Reif, Martin Brokate 

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

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

Recommendations

• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• Minimum weight paths in time-dependent networks
• On the complexity of time-dependent shortest paths
• Shortest paths in time-dependent FIFO networks
• Improved approximation for time-dependent shortest paths

zbMATH Keywords

dynamic programminganalysis of algorithmsapproximation algorithmshortest path problemdeterministic network models

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Approximation algorithms (68W25)

Cites Work

• A note on two problems in connexion with graphs
• On a routing problem
• Consensus and Cooperation in Networked Multi-Agent Systems
• A set oriented approach to global optimal control
• Title not available (Why is that?)
• Generalized best-first search strategies and the optimality of A*
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Time-dependent route planning
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• Multiobjective A*
• New complexity results for time-constrained dynamical optimal path problems
• Engineering Route Planning Algorithms
• Minimum weight paths in time-dependent networks
• Title not available (Why is that?)
• Dynamic flows in time-varying networks.
• Bidirectional A  ∗  Search for Time-Dependent Fast Paths
• Time-varying shortest path problems with constraints
• Shortest paths in a network with time-dependent flow speeds
• Continuous-Time Shortest Path Problems and Linear Programming
• A finite-time algorithm for shortest path problems with time-varying costs
• Dynamic shortest paths minimizing travel times and costs
• Continuous-time shortest path problems with stopping and starting costs
• Piecewise-linear programming: The compact (CPLP) algorithm

Cited In (2)

• Minimum cost paths over dynamic networks
• A path-based gradient projection algorithm for the cost-based system optimum problem in networks with continuously distributed value of time

This page was built for publication: Computation of the optimal value function in time-dependent networks

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