Minimum work paths in elevated networks

DOI10.1002/NET.20225zbMATH Open1228.05275OpenAlexW4256262641MaRDI QIDQ3528153FDOQ3528153

Authors: Takeshi Shirabe 

Publication date: 8 October 2008

Published in: Networks (Search for Journal in Brave)

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

Recommendations

• Minisum amd minimax paths of a moving facility on a network
• Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
• Dynamic shortest paths minimizing travel times and costs
• The problems of selecting an optimal path on network
• Minimum weight paths in time-dependent networks

zbMATH Keywords

dynamic programmingshortest pathsphysical constraintsstate-dependent networks

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Paths and cycles (05C38)

Cites Work

• Network flows. Theory, algorithms, and applications.

This page was built for publication: Minimum work paths in elevated networks

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