Dynamic minimum cost path problem with curfews

DOI10.3785/J.ISSN.1008-9497.2008.04.008MaRDI QIDQ3402950zbMATH OpenFDO

Authors Caixiang He, Enyu Yao, Hao Ge

Publication date 12 February 2010

zbMATH Keywords

dynamic problemcurfewsshortest cost path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• Time-varying shortest path problem with curfews
• Dynamic shortest paths minimizing travel times and costs
• Dynamic shortest path problems with time-varying costs
• Minimum cost paths over dynamic networks
• scientific article; zbMATH DE number 1918689

Cited in

(1)

• Time-varying shortest path problem with curfews

This page was built for publication: Dynamic minimum cost path problem with curfews

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