On the question of the optimization of permutations in the problem with dynamic constraints
From MaRDI portal
Publication:5114333
DOI10.20537/VM190307zbMath1445.90112OpenAlexW2984963646MaRDI QIDQ5114333
Alekseĭ Aleksandrovich Chentsov, A. G. Chentsov
Publication date: 22 June 2020
Published in: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/vuu689
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Route problem with constraints depending on a list of tasks
- Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
- Routing under constraints: problem of visit to megalopolises
- Procedures for travelling salesman problems with additional constraints
- Boundedness of optimal trajectories
- The traveling salesman problem and its variations.
- To question of routing of works complexes
- Local dynamic programming incuts in routing problems with restrictions
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- The Bellmann insertions in the route problem with constraints and complicated cost functions
- A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
- Optimizing multi-inserts in routing problems with constraints
- Dynamic programming in the generalized bottleneck problem and the start point optimization
- Routing of displacements with dynamic constraints: “bottleneck problem”
- The Bellmann insertions in route problems with constraints and complicated cost functions. II
- An Algorithm for the Traveling Salesman Problem
- In Pursuit of the Traveling Salesman
This page was built for publication: On the question of the optimization of permutations in the problem with dynamic constraints
