scientific article; zbMATH DE number 6393860

MaRDI QIDQ5496506zbMATH OpenFDO

Authors Dmitrii Lozovanu

Publication date 2 February 2015

Full work available at URL http://www.math.md/publications/basm/issues/y2014-n1/11640/

zbMATH Keywords

networksoptimal pathspolynomial time algorithmtime transition costtotal rated cost

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Recommendations

• scientific article; zbMATH DE number 1783111
• Determining minimum cost flows in dynamic networks with transit time functions that depend on flow and time
• Algorithms for minimum-cost paths in time-dependent networks with waiting policies
• On computing Pareto optimal paths in weighted time-dependent networks
• The problems of selecting an optimal path on network
• Minimum cost paths over dynamic networks
• Path optimization in stochastic and time-dependent networks with multi-attributes
• A problems of selecting a optimal path on network
• Optimal Dynamic Routing in Multidestination Networks

Cited in

(3)

• A path-based gradient projection algorithm for the cost-based system optimum problem in networks with continuously distributed value of time
• scientific article; zbMATH DE number 3918399 (Why is no real title available?)
• Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks

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 Q5496506)