Pages that link to "Item:Q4698228"
From MaRDI portal
The following pages link to Sales‐delivery man problems on treelike networks (Q4698228):
Displayed 7 items.
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038) (← links)
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129) (← links)
- A note on the traveling repairman problem (Q4785216) (← links)