The dynamic programming method in the generalized traveling salesman problem

DOI10.1016/S0895-7177(96)00187-2MaRDI QIDQ1362222zbMATH OpenOpenAlexFDO

Authors A. G. Chentsov, L. N. Korotayeva

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

zbMATH Keywords

bottleneckroute optimizationtaveling salesmandiscrete-continuous problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

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)

• Disentangling causal relationships of a manufacturing process using genetic algorithms and six-sigma techniques
• A parallel procedure of constructing Bellman function in the generalized courier problem with interior works
• Reduction of route optimization problems
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
• Dynamic programming in the generalized bottleneck problem and the start point optimization
• 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 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
• Dynamic programming in a nonstationary route problem
• 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
• Discrete/Binary approach
• Problem of optimal choice of a route under conditions of time discounting
• Dynamic programming method in bottleneck tasks distribution problem with equal agents
• Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
• 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)