Algorithms for the minimax problem of the travelling salesman. II: Dual approach

zbMath0917.90253MaRDI QIDQ1285427

S. I. Sergeev, A. B. Chernyshenko

Publication date: 5 August 1999

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

zbMATH Keywords

traveling salesmanbranch-and-boundminimax problem

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (3)

The symmetric travelling salesman problem. II: New low bounds ⋮ Discrete optimization by optimal control methods. I: Separable problems ⋮ Experimental analysis of heuristics for the bottleneck traveling salesman problem

This page was built for publication: Algorithms for the minimax problem of the travelling salesman. II: Dual approach