An approach to solution of the movements routing problem with several participants

DOI10.1134/S1064230710040076zbMATH Open1276.90059MaRDI QIDQ357112FDOQ357112

Authors: A. G. Chentsov, P. A. Chentsov, E. E. Ivanko 

Publication date: 29 July 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Recommendations

• Dynamic programming method in extremal constrained routing problems
• Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
• On a problem of route optimization and its applications.
• On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
• A generalized Courier problem with the cost function depending on the list of tasks

zbMATH Keywords

dynamic programminggreedy algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An assignment problem
• Dynamic programming in the problem of decomposition optimization
• Reduction of route optimization problems
• Partitioning a finite set by a dynamic programming method
• Solving the routing optimization problem using the dynamic programming method
• A modification of the dynamic programming method for the travelling-salesman problem
• Dynamic programming method in the generalized courier problem
• Job distribution algorithms

This page was built for publication: An approach to solution of the movements routing problem with several participants

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