The dynamic programming method in the generalized traveling salesman problem
From MaRDI portal
Recommendations
- Dynamic programming in a nonstationary route problem
- Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
- Dynamic programming method in the generalized courier problem
- The travelling-salesman problem with moving objects
- A modification of the dynamic programming method for the travelling-salesman problem
Cites work
- scientific article; zbMATH DE number 5729141 (Why is no real title available?)
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- A modification of the dynamic programming method for the travelling-salesman problem
- An assignment problem
- Dynamic Programming Treatment of the Travelling Salesman Problem
- ON A NEW APPROACH TO THE NUMERICAL SOLUTION OF A CLASS OF PARTIAL DIFFERENTIAL INTEGRAL EQUATIONS OF TRANSPORT THEORY
- On a generalization of the bottleneck traveling salesman problem
Cited in
(18)- Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.
- Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- Discrete/Binary approach
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem
- A parallel procedure of constructing Bellman function in the generalized courier problem with interior works
- Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
- Disentangling causal relationships of a manufacturing process using genetic algorithms and six-sigma techniques
- Reduction of route optimization problems
- Solving dynamic traveling salesman problem using dynamic Gaussian process regression
- Dynamic programming in the generalized bottleneck problem and the start point optimization
- An effective genetic algorithm approach to multiobjective routing problems (MORPs)
- A random-key genetic algorithm for the generalized traveling salesman problem
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
- Dynamic programming method in bottleneck tasks distribution problem with equal agents
- Dynamic programming and the backpacker's linear search problem
- Dynamic programming in a nonstationary route problem
- Problem of optimal choice of a route under conditions of time discounting
This page was built for publication: The dynamic programming method in the generalized traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362222)
