Optimizing multi-inserts in routing problems with constraints
From MaRDI portal
Publication:5114290
DOI10.20537/vm180406zbMath1445.90113OpenAlexW2916156373WikidataQ128314173 ScholiaQ128314173MaRDI QIDQ5114290
Alekseĭ Mikhaĭlovich Grigor'Ev, A. G. Chentsov
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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Route problem with constraints depending on a list of tasks
- Problem of successive megalopolis traversal with the precedence conditions
- 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
- On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
- Extremal routing problem with internal losses
- Local dynamic programming incuts in routing problems with restrictions
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- The Bellmann insertions in the route problem with constraints and complicated cost functions
- 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
- Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
- An Algorithm for the Traveling Salesman Problem
- In Pursuit of the Traveling Salesman
This page was built for publication: Optimizing multi-inserts in routing problems with constraints
