The minimax problem of M-travelling salesmen

MaRDI QIDQ1190104zbMATH OpenFDO

Authors A. O. Alekseev

Publication date 27 September 1992

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

\(M\) travelling salesmenminimax problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Algorithms for the minimax problem of the travelling salesman. II: Dual approach
• scientific article; zbMATH DE number 1902274
• The m-Traveling Salesman Problem with Minmax Objective
• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
• Truncated \(M\)-travelling salesman problem

Cited in

(6)

• Minmax \(p\)-traveling salesmen location problems on a tree
• The undirected \(m\)-capacitated peripatetic salesman problem
• scientific article; zbMATH DE number 4160472 (Why is no real title available?)
• A multivariant travelling-salesman problem
• The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories
• The m-Traveling Salesman Problem with Minmax Objective

This page was built for publication: The minimax problem of \(M\)-travelling salesmen

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190104)