The dynamic programming method in the generalized traveling salesman problem

DOI10.1016/S0895-7177(96)00187-2zbMath0881.90118OpenAlexW2015380770MaRDI QIDQ1362222

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

zbMATH Keywords

bottleneckroute optimizationtaveling salesmandiscrete-continuous problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem, A random-key genetic algorithm for the generalized traveling salesman 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, Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations., Disentangling causal relationships of a manufacturing process using genetic algorithms and six-sigma techniques, Discrete/Binary Approach

Cites Work

• Unnamed Item
• Unnamed Item
• An assignment problem
• On a generalization of the bottleneck traveling salesman problem
• 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
• ON A NEW APPROACH TO THE NUMERICAL SOLUTION OF A CLASS OF PARTIAL DIFFERENTIAL INTEGRAL EQUATIONS OF TRANSPORT THEORY