Pages that link to "Item:Q920033"
From MaRDI portal
The following pages link to The delivery man problem on a tree network (Q920033):
Displaying 14 items.
- Polynomial time algorithms for some minimum latency problems (Q294831) (← links)
- Exact algorithms for the minimum latency problem (Q834971) (← links)
- Profit-based latency problems on the line (Q943793) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- The Chinese deliveryman problem (Q2025136) (← links)
- A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- Approximating the \(k\)-traveling repairman problem with repair times (Q2457300) (← links)
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129) (← links)
- The Directed Minimum Latency Problem (Q3541796) (← links)
- A note on the traveling repairman problem (Q4785216) (← links)
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
