An extremal constrained routing problem with internal losses
From MaRDI portal
Publication:1956632
DOI10.3103/S1066369X10060071zbMath1207.90016OpenAlexW2037260051MaRDI QIDQ1956632
Publication date: 23 September 2010
Published in: Russian Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s1066369x10060071
Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (4)
Elements of dynamic programming in extremal routing problems ⋮ On an iterative procedure for solving a routing problem with constraints ⋮ On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs ⋮ Dynamic programming in the routing problem with complex dependence of costs on the list of jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The traveling salesman problem. II: Exact methods
- Hybrid control systems and the dynamic traveling salesman problem
- An assignment problem
- On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
- Route optimization by a dynamic programming technique
- The iterations method in generalized courier problem with singularity in the definition of cost functions
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- A modification of the dynamic programming method for the travelling-salesman problem
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- An Algorithm for the Traveling Salesman Problem
- Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.
This page was built for publication: An extremal constrained routing problem with internal losses
