New complexity results for time-constrained dynamical optimal path problems

DOI10.7155/JGAA.00201MaRDI QIDQ3402377zbMATH OpenOpenAlexFDO

Authors Sebastian Kluge, Martin Brokate, Konrad Reif

Publication date 4 February 2010

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/223553

zbMATH Keywords

cost optimal paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39)

Recommendations

• Cheapest paths in dynamic networks
• On the complexity of time-dependent shortest paths
• On the complexity of time-dependent shortest paths
• Minimum cost paths over dynamic networks
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies

Cited in

(6)

• A note on time-optimal paths on perturbed spheroid
• Computation of the optimal value function in time-dependent networks
• Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
• Minimum cost paths over dynamic networks
• scientific article; zbMATH DE number 3934720 (Why is no real title available?)
• Computation of Path Constrained Time Optimal Motions With Dynamic Singularities

This page was built for publication: New complexity results for time-constrained dynamical optimal path problems

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