Problem of successive megalopolis traversal with the precedence conditions
From MaRDI portal
Publication:463382
Recommendations
- Routing under constraints: problem of visit to megalopolises
- Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
- To question of routing of works complexes
- scientific article; zbMATH DE number 6315689
Cites work
- An Algorithm for the Traveling Salesman Problem
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Dynamic programming in a nonstationary route problem
- Generalized delivery problem
- Heuristic algorithm for solving the generalized delivery problem
- The iterations method in generalized courier problem with singularity in the definition of cost functions
- The traveling salesman problem. Approximate algorithms
- The traveling salesman problem. I: Theoretical issues
- The traveling salesman problem. II: Exact methods
- To question of routing of works complexes
Cited in
(21)- A bottleneck routing problem with a system of priority tasks
- The Bellmann insertions in the route problem with constraints and complicated cost functions
- The iterations method in generalized courier problem with singularity in the definition of cost functions
- To question of routing of works complexes
- A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
- On sequential traversal of sets
- Elements of dynamic programming in extremal routing problems
- Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
- Optimizing multi-inserts in routing problems with constraints
- A discrete-continuous routing problem with precedence constraints
- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
- On one routing task with the optimization of the start-finish point
- The routing problems with optimization of the starting point: dynamic programming
- An exact algorithm with linear complexity for a problem of visiting megalopolises
- Two-stage dynamic programming in the routing problem with decomposition
- Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
- Optimizing insertions in a constraint routing problem with complicated cost functions
- Routing under constraints: problem of visit to megalopolises
- Route problem with constraints depending on a list of tasks
- Generalized model of courier with additional restrictions
- Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
This page was built for publication: Problem of successive megalopolis traversal with the precedence conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463382)
