Dynamic programming in the generalized bottleneck problem and the start point optimization
From MaRDI portal
Publication:5224167
DOI10.20537/VM180306zbMATH Open1423.90266OpenAlexW2897377739WikidataQ129059109 ScholiaQ129059109MaRDI QIDQ5224167FDOQ5224167
Authors: A. G. Chentsov, A. A. Chentsov, A. N. Sesekin 
Publication date: 19 July 2019
Published in: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/vuu643
Recommendations
- Routing of displacements with dynamic constraints: ``bottleneck problem
- On a bottleneck routing problem
- The dynamic programming method in the generalized traveling salesman problem
- The routing problems with optimization of the starting point: dynamic programming
- A model of nonadditive routing problem where the costs depend on the set of pending tasks
Cites Work
- Title not available (Why is that?)
- On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
- The traveling salesman problem. I: Theoretical issues
- Title not available (Why is that?)
- Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
- The traveling salesman problem and its variations.
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- The traveling salesman problem. II: Exact methods
- The traveling salesman problem. Approximate algorithms
- To question of routing of works complexes
- Routing of displacements with dynamic constraints: ``bottleneck problem
Cited In (10)
- On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
- To the question of optimization of the starting point in the routing problem with restrictions
- The routing problems with optimization of the starting point: dynamic programming
- On a bottleneck routing problem
- Routing of displacements with dynamic constraints: ``bottleneck problem
- On routing problem with starting point optimization
- Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
- A bottleneck routing problem with a system of priority tasks
- Dynamic programming method in bottleneck tasks distribution problem with equal agents
- On the question of the optimization of permutations in the problem with dynamic constraints
This page was built for publication: Dynamic programming in the generalized bottleneck problem and the start point optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224167)
