Route optimization by a dynamic programming technique

MaRDI QIDQ1882209zbMATH OpenFDO

Authors Yanyan Li, A. A. Chentsov, A. G. Chentsov

Publication date 19 October 2004

Published in Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Dynamic programming (90C39)

Recommendations

• Reduction of route optimization problems
• Solving the routing optimization problem using the dynamic programming method
• On a problem of route optimization and its applications.
• Dynamic optimization for reachability problems.
• scientific article; zbMATH DE number 519987

Cited in

(9)

• On a problem of route optimization and its applications.
• Differentiation in the problem of an approximation ensuring the best allocation
• Reduction of route optimization problems
• An extremal constrained routing problem with internal losses
• Solving the routing optimization problem using the dynamic programming method
• Problem of optimal route determining for linear systems with fixed horizon
• Selecting an Optimum Configuration of One-Way and Two-Way Routes
• Qualification routes messaging for dynamic systems using logical-probabilistic method
• Dynamic optimization for reachability problems.

This page was built for publication: Route optimization by a dynamic programming technique

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