Reduction of route optimization problems

MaRDI QIDQ1882016zbMATH OpenFDO

Authors Yanyan Li

Publication date 18 October 2004

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Route optimization by a dynamic programming technique
• The dynamic programming method in the generalized traveling salesman problem
• A modification of the dynamic programming method for the travelling-salesman problem
• Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
• On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.

Cited in

(7)

• Route optimization by a dynamic programming technique
• Reducing Path TSP to TSP
• A modification of the dynamic programming method for the travelling-salesman problem
• On an iterative procedure for solving a routing problem with constraints
• On optimal reduction of the cost matrix
• Dynamic programming method in extremal constrained routing problems
• An approach to solution of the movements routing problem with several participants

This page was built for publication: Reduction of route optimization problems

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