Problem of successive megalopolis traversal with the precedence conditions
From MaRDI portal
Publication:463382
DOI10.1134/S0005117914040122zbMath1297.90169MaRDI QIDQ463382
Publication date: 16 October 2014
Published in: Automation and Remote Control (Search for Journal in Brave)
Related Items (12)
Route problem with constraints depending on a list of tasks ⋮ Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints ⋮ An exact algorithm with linear complexity for a problem of visiting megalopolises ⋮ A model variant of the problem about radiation sources utilization (iterations based on optimization insertions) ⋮ Two-stage dynamic programming in the routing problem with decomposition ⋮ Optimizing multi-inserts in routing problems with constraints ⋮ On one routing task with the optimization of the start-finish point ⋮ The routing problems with optimization of the starting point: dynamic programming ⋮ Routing under constraints: problem of visit to megalopolises ⋮ A discrete-continuous routing problem with precedence constraints ⋮ Optimizing insertions in a constraint routing problem with complicated cost functions ⋮ Generalized Model of Courier with Additional Restrictions
Cites Work
- Unnamed Item
- The traveling salesman problem. Approximate algorithms
- The traveling salesman problem. I: Theoretical issues
- The traveling salesman problem. II: Exact methods
- Heuristic algorithm for solving the generalized delivery problem
- Generalized delivery problem
- To question of routing of works complexes
- The iterations method in generalized courier problem with singularity in the definition of cost functions
- Dynamic Programming Treatment of the Travelling Salesman Problem
- An Algorithm for the Traveling Salesman Problem
This page was built for publication: Problem of successive megalopolis traversal with the precedence conditions
