Pages that link to "Item:Q1872012"
From MaRDI portal
The following pages link to Minmax \(p\)-traveling salesmen location problems on a tree (Q1872012):
Displaying 16 items.
- Efficient algorithms for the round-trip 1-center and 1-median problems (Q269488) (← links)
- An exact solution approach for multi-objective location-transportation problem for disaster response (Q336763) (← links)
- A hybrid algorithm for linearly constrained minimax problems (Q363595) (← links)
- Approximation results for a min-max location-routing problem (Q765374) (← links)
- The multiple traveling salesman problem on spiders (Q831830) (← links)
- Location-routing: issues, models and methods (Q856260) (← links)
- Minisum location of a travelling salesman on simple networks (Q1107451) (← links)
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective (Q1363767) (← links)
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (Q1653368) (← links)
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree (Q1917344) (← links)
- The optimal dispatch of Traffic and Patrol Police Service Platforms (Q1952815) (← links)
- Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree (Q2509522) (← links)
- A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
- Optimal locations and districts of two traveling salesmen on a tree (Q3204320) (← links)
- Minisum multipurpose trip location problem on trees (Q4639691) (← links)
