To the question of optimization of the starting point in the routing problem with restrictions

DOI10.35634/2226-3594-2020-55-09zbMath1458.90071OpenAlexW3038858506WikidataQ113203171 ScholiaQ113203171MaRDI QIDQ5151947

P. A. Chentsov, A. G. Chentsov

Publication date: 17 February 2021

Published in: Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programmingprecedence conditionsroute

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (3)

On sequential traversal of sets ⋮ On the route construction in changing environments using solutions of the eikonal equation ⋮ ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Routing under constraints: problem of visit to megalopolises
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• The traveling salesman problem and its variations.
• To question of routing of works complexes
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Оptimization of the Start Point in the Gtsp with the Precedence Conditions
• On one routing task with the optimization of the start-finish point
• An Algorithm for the Traveling Salesman Problem
• In Pursuit of the Traveling Salesman

This page was built for publication: To the question of optimization of the starting point in the routing problem with restrictions