Minmax \(p\)-traveling salesmen location problems on a tree

DOI10.1023/A:1020759332183zbMath1013.90103OpenAlexW104314163MaRDI QIDQ1872012

Igor Averbakh, Oded Berman

Publication date: 4 May 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020759332183

zbMATH Keywords

traveling salesman problempolynomial algorithmlocation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (8)

Efficient algorithms for the round-trip 1-center and 1-median problems ⋮ Location-routing: issues, models and methods ⋮ An exact solution approach for multi-objective location-transportation problem for disaster response ⋮ A profit-maximization location-routing-pricing problem: a branch-and-price algorithm ⋮ A hybrid algorithm for linearly constrained minimax problems ⋮ The optimal dispatch of Traffic and Patrol Police Service Platforms ⋮ Approximation results for a min-max location-routing problem ⋮ A taxonomical analysis, current methods and objectives on location-routing problems

This page was built for publication: Minmax \(p\)-traveling salesmen location problems on a tree