Pages that link to "Item:Q294831"
From MaRDI portal
The following pages link to Polynomial time algorithms for some minimum latency problems (Q294831):
Displaying 6 items.
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
- Exact algorithms for the minimum latency problem (Q834971) (← links)
- Profit-based latency problems on the line (Q943793) (← links)
- Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
- Approximation algorithms for the a priori traveling repairman (Q2661528) (← links)
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization (Q6073272) (← links)
