Pages that link to "Item:Q2428683"
From MaRDI portal
The following pages link to Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683):
Displaying 4 items.
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- Deadline TSP (Q5925174) (← links)
