Problem of optimal choice of a route under conditions of time discounting

DOI10.1007/BF02667918zbMath0946.90072OpenAlexW2040219392MaRDI QIDQ1968514

A. G. Chentsov, L. V. Tonkov

Publication date: 25 October 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02667918

zbMATH Keywords

dynamic programmingtraveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (1)

Elements of dynamic programming in extremal routing problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Pursuit of a group of evaders by a single controlled object

This page was built for publication: Problem of optimal choice of a route under conditions of time discounting