Pages that link to "Item:Q920033"
From MaRDI portal
The following pages link to The delivery man problem on a tree network (Q920033):
Displaying 23 items.
- Polynomial time algorithms for some minimum latency problems (Q294831) (← links)
- Network design for time-constrained delivery using subgraphs (Q395697) (← links)
- Exact algorithms for the minimum latency problem (Q834971) (← links)
- On single courier problem (Q941049) (← 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)
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios (Q2294628) (← 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)
- The Delivery Man Problem and Cumulative Matroids (Q4285163) (← links)
- Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path (Q4302932) (← links)
- Restricted delivery problems on a network (Q4347274) (← links)
- Sales‐delivery man problems on treelike networks (Q4698228) (← links)
- A note on the traveling repairman problem (Q4785216) (← links)
- Network design for time‐constrained delivery (Q5503760) (← links)
- Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree (Q5689146) (← links)
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
