Problem of successive megalopolis traversal with the precedence conditions

DOI10.1134/S0005117914040122zbMATH Open1297.90169MaRDI QIDQ463382FDOQ463382

Authors: A. G. Chentsov 

Publication date: 16 October 2014

Published in: Automation and Remote Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Dynamic programming (90C39)

Cites Work

• An Algorithm for the Traveling Salesman Problem
• The traveling salesman problem. I: Theoretical issues
• Dynamic Programming Treatment of the Travelling Salesman Problem
• The traveling salesman problem. II: Exact methods
• The traveling salesman problem. Approximate algorithms
• Heuristic algorithm for solving the generalized delivery problem
• Generalized delivery problem
• Dynamic programming in a nonstationary route problem
• To question of routing of works complexes
• The iterations method in generalized courier problem with singularity in the definition of cost functions

Cited In (21)

• The iterations method in generalized courier problem with singularity in the definition of cost functions
• To question of routing of works complexes
• On one routing task with the optimization of the start-finish point
• 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
• Elements of dynamic programming in extremal routing problems
• On sequential traversal of sets
• A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
• A discrete-continuous routing problem with precedence constraints
• The routing problems with optimization of the starting point: dynamic programming
• Generalized model of courier with additional restrictions
• Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
• Optimizing multi-inserts in routing problems with constraints
• Optimizing insertions in a constraint routing problem with complicated cost functions
• A bottleneck routing problem with a system of priority 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
• On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
• Routing under constraints: problem of visit to megalopolises
• Two-stage dynamic programming in the routing problem with decomposition
• The Bellmann insertions in the route problem with constraints and complicated cost functions

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)