Route problem with constraints depending on a list of tasks

DOI10.1134/S1064562415060083MaRDI QIDQ265955zbMATH OpenFDO

Authors A. G. Chentsov, A. A. Chentsov

Publication date 13 April 2016

Published in Doklady Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• A model of nonadditive routing problem where the costs depend on the set of pending tasks
• Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
• Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
• About one route problem with interior works
• On an iterative procedure for solving a routing problem with constraints

Cites work

• scientific article; zbMATH DE number 3324725 (Why is no real title available?)
• scientific article; zbMATH DE number 3198203 (Why is no real title available?)
• Constrained optimal routing
• 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 a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
• Problem of successive megalopolis traversal with the precedence conditions
• The traveling salesman problem and its variations
• The traveling salesman problem. I: Theoretical issues

Cited in

(12)

• On one routing problem modeling movement in radiation fields
• On one routing task with the optimization of the start-finish point
• Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
• A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
• A discrete-continuous routing problem with precedence constraints
• Solving a routing problem with the aid of an independent computations scheme
• Optimization of the start point in the GTSP with the precedence conditions
• Optimizing multi-inserts in routing problems with constraints
• Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions
• On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
• Extremal bottleneck routing problem with constraints in the form of precedence conditions
• On the question of the optimization of permutations in the problem with dynamic constraints

This page was built for publication: Route problem with constraints depending on a list of tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265955)