An approach to solution of the movements routing problem with several participants
From MaRDI portal
Publication:357112
DOI10.1134/S1064230710040076zbMath1276.90059MaRDI QIDQ357112
A. G. Chentsov, P. A. Chentsov, Evgeny Ivanko
Publication date: 29 July 2013
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic programming method in the generalized courier problem
- Job distribution algorithms
- 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
This page was built for publication: An approach to solution of the movements routing problem with several participants