Minmax p-traveling salesmen location problems on a tree

DOI10.1023/A:1020759332183zbMATH Open1013.90103OpenAlexW104314163MaRDI QIDQ1872012FDOQ1872012

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

Recommendations

• Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree
• \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
• A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
• The minimax multistop location problem on a tree
• Minisum multipurpose trip location problem on trees
• The minimax problem of \(M\)-travelling salesmen
• A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
• Range minimization problems in path-facility location on trees
• Distance-constrained multifacility minimax location problems on tree networks
• Optimal locations and districts of two traveling salesmen on a tree

zbMATH Keywords

locationtraveling salesman problempolynomial algorithm

Mathematics Subject Classification ID

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

Cited In (12)

• A taxonomical analysis, current methods and objectives on location-routing problems
• Efficient algorithms for the round-trip 1-center and 1-median problems
• Location-routing: issues, models and methods
• Minisum location of a travelling salesman on simple networks
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
• Approximation results for a min-max location-routing problem
• Optimal locations and districts of two traveling salesmen on a tree
• An exact solution approach for multi-objective location-transportation problem for disaster response
• A hybrid algorithm for linearly constrained minimax problems
• The optimal dispatch of Traffic and Patrol Police Service Platforms
• A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
• Minisum multipurpose trip location problem on trees

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

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