OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS
From MaRDI portal
Publication:5125218
DOI10.15826/umj.2018.2.006zbMath1448.90015OpenAlexW2908249808WikidataQ128651844 ScholiaQ128651844MaRDI QIDQ5125218
A. G. Chentsov, Alekseĭ Mikhaĭlovich Grigor'Ev, Alexey Chentsov
Publication date: 5 October 2020
Published in: Ural mathematical journal (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/umj62
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Dynamic programming (90C39)
Cites Work
- Route problem with constraints depending on a list of tasks
- Elements of dynamic programming in extremal routing problems
- Routing under constraints: problem of visit to megalopolises
- A discrete-continuous routing problem with precedence constraints
- The traveling salesman problem. Approximate algorithms
- The traveling salesman problem. I: Theoretical issues
- The traveling salesman problem. II: Exact methods
- An inexact algorithm for the sequential ordering problem
- 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
- An exact algorithm with linear complexity for a problem of visiting megalopolises
- A Scheme of Independent Calculations in a Precedence Constrained Routing Problem
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
- On one routing problem modeling movement in radiation fields
- Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
- In Pursuit of the Traveling Salesman
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS
