Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming

zbMath0917.90252MaRDI QIDQ1285454

S. I. Sergeev

Publication date: 26 April 1999

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingtraveling salesmanminimax problemmultistep control process

Mathematics Subject Classification ID

Integer programming (90C10) Dynamic programming (90C39)

Related Items (6)

The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ Minimax routing problem with a system of priority tasks ⋮ On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics ⋮ A bottleneck routing problem with a system of priority tasks ⋮ Experimental analysis of heuristics for the bottleneck traveling salesman problem ⋮ Dynamic programming in the generalized bottleneck problem and the start point optimization

This page was built for publication: Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming