Optimizing multi-inserts in routing problems with constraints

DOI10.20537/VM180406zbMATH Open1445.90113OpenAlexW2916156373WikidataQ128314173 ScholiaQ128314173MaRDI QIDQ5114290FDOQ5114290

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

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

zbMATH Keywords

dynamic programmingparallel algorithmmulti-inserts

Mathematics Subject Classification ID

Dynamic programming (90C39)

Cites Work

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

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)