Dynamic programming in the routing problem: decomposition variant
From MaRDI portal
Publication:5097703
DOI10.20310/2686-9667-2022-27-137-95-124OpenAlexW4226240865MaRDI QIDQ5097703FDOQ5097703
Authors: A. G. Chentsov, P. A. Chentsov 
Publication date: 31 August 2022
Published in: Russian Universities Reports. Mathematics (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/vtamu249
Recommendations
- Two-stage dynamic programming in the routing problem with decomposition
- The routing problems with optimization of the starting point: dynamic programming
- On the question of the optimization of permutations in the problem with dynamic constraints
- Local dynamic programming incuts in routing problems with restrictions
Dynamic programming (90C39) Problems with incomplete information (optimization) (49N30) Optimal feedback synthesis (49N35)
Cites Work
- The traveling salesman problem and its variations
- Title not available (Why is that?)
- Procedures for travelling salesman problems with additional constraints
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- New classes of efficiently solvable generalized traveling salesman problems
- Extremal routing problem with internal losses
- To question of routing of works complexes
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Routing under constraints: problem of visit to megalopolises
- Approximation schemes for the generalized traveling salesman problem
- THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
- The routing problems with optimization of the starting point: dynamic programming
Cited In (5)
This page was built for publication: Dynamic programming in the routing problem: decomposition variant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097703)
