Pages that link to "Item:Q294831"
From MaRDI portal
The following pages link to Polynomial time algorithms for some minimum latency problems (Q294831):
Displaying 13 items.
- Two improved formulations for the minimum latency problem (Q346133) (← links)
- 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)
- Computing the optimal IO sequences of a protocol in polynomial time (Q1183459) (← links)
- Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
- Weighted online minimum latency problem with edge uncertainty (Q2239843) (← links)
- Approximation algorithms for the a priori traveling repairman (Q2661528) (← links)
- Approximation schemes for minimum latency problems (Q2819598) (← links)
- (Q3128904) (← links)
- Waiting for a Bat to Fly By (in Polynomial Time) (Q3412101) (← links)
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays (Q4575807) (← links)
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization (Q6073272) (← links)