To question of routing of works complexes

DOI10.20537/VM130107MaRDI QIDQ2932380zbMATH OpenOpenAlexFDO

Authors A. G. Chentsov

Publication date 1 December 2014

Published in Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/vuu364

zbMATH Keywords

dynamic programmingpreceding conditionsroute

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• Routing under constraints: problem of visit to megalopolises
• Problem of successive megalopolis traversal with the precedence conditions
• scientific article; zbMATH DE number 6315689
• Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
• About one route problem with interior works

Cited in

(21)

• Optimizing insertions in a constraint routing problem with complicated cost functions
• 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
• The iterations method in generalized courier problem with singularity in the definition of cost functions
• About one route problem with interior works
• Problem of successive megalopolis traversal with the precedence conditions
• Solving a routing problem with the aid of an independent computations scheme
• On one routing problem modeling movement in radiation fields
• Optimization of the start point in the GTSP with the precedence conditions
• On routing problem with starting point optimization
• On sequential traversal of sets
• One task of routing jobs in high radiation conditions
• Dynamic programming in the routing problem: decomposition variant
• Routing under constraints: problem of visit to megalopolises
• On the question of the optimization of permutations in the problem with dynamic constraints
• The routing problems with optimization of the starting point: dynamic programming
• To the question of optimization of the starting point in the routing problem with restrictions
• Dynamic programming in the generalized bottleneck problem and the start point optimization
• On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
• Dynamic programming and decomposition in extreme routing problems
• Multi-level dynamic programming in routing problems with constraints

This page was built for publication: To question of routing of works complexes

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