The dynamic programming method in the generalized traveling salesman problem
From MaRDI portal
Publication:1362222
DOI10.1016/S0895-7177(96)00187-2zbMATH Open0881.90118OpenAlexW2015380770MaRDI QIDQ1362222FDOQ1362222
L. N. Korotayeva, A. G. Chentsov
Publication date: 3 August 1997
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(96)00187-2
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
- A Dynamic Programming Approach to Sequencing Problems
- Title not available (Why is that?)
- Dynamic Programming Treatment of the Travelling Salesman Problem
- An assignment problem
- On a generalization of the bottleneck traveling salesman problem
- A modification of the dynamic programming method for the travelling-salesman problem
- ON A NEW APPROACH TO THE NUMERICAL SOLUTION OF A CLASS OF PARTIAL DIFFERENTIAL INTEGRAL EQUATIONS OF TRANSPORT THEORY
- Title not available (Why is that?)
Cited In (13)
- Reduction of route optimization problems
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.
- An effective genetic algorithm approach to multiobjective routing problems (MORPs)
- Dynamic programming and the backpacker's linear search problem
- A random-key genetic algorithm for 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 pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
- Problem of optimal choice of a route under conditions of time discounting
- 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
- Solving dynamic traveling salesman problem using dynamic Gaussian process regression
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)
