ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION
From MaRDI portal
Publication:4986290
DOI10.15826/umj.2020.2.005zbMath1465.90084OpenAlexW3117743844MaRDI QIDQ4986290
A. G. Chentsov, P. A. Chentsov
Publication date: 27 April 2021
Published in: Ural Mathematical Journal (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/umj125
Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (1)
Cites Work
- 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
- To the question of optimization of the starting point in the routing problem with restrictions
- An Algorithm for the Traveling Salesman Problem
- In Pursuit of the Traveling Salesman
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION