Optimizing multi-inserts in routing problems with constraints

DOI10.20537/VM180406MaRDI QIDQ5114290zbMATH OpenOpenAlexWikidataFDO

Authors A. G. Chentsov, Alexei Grigoriev

Publication date 22 June 2020

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

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

zbMATH Keywords

dynamic programmingparallel algorithmmulti-inserts

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• Optimizing insertions in a constraint routing problem with complicated cost functions
• The Bellmann insertions in the route problem with constraints and complicated cost functions
• The Bellmann insertions in route problems with constraints and complicated cost functions. II
• Routing under constraints: problem of visit to megalopolises
• Problem of successive megalopolis traversal with the precedence conditions

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3198203 (Why is no real title available?)
• A Dynamic Programming Approach to Sequencing Problems
• A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
• A parallel procedure of constructing Bellman function in the generalized courier problem with interior works
• An Algorithm for the Traveling Salesman Problem
• Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Extremal routing problem with internal losses
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• Local dynamic programming incuts in routing problems with restrictions
• On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
• On constructing the shortest circuits on a set of line segments
• Problem of successive megalopolis traversal with the precedence conditions
• Route problem with constraints depending on a list of tasks
• The Bellmann insertions in route problems with constraints and complicated cost functions. II
• The Bellmann insertions in the route problem with constraints and complicated cost functions
• The traveling salesman problem and its variations
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods

Cited in

(6)

• A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
• The Bellmann insertions in route problems with constraints and complicated cost functions. II
• On an iterative procedure for solving a routing problem with constraints
• Optimizing insertions in a constraint routing problem with complicated cost functions
• On the question of the optimization of permutations in the problem with dynamic constraints
• The Bellmann insertions in the route problem with constraints and complicated cost functions

This page was built for publication: Optimizing multi-inserts in routing problems with constraints

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