Pages that link to "Item:Q2819598"
From MaRDI portal
The following pages link to Approximation schemes for minimum latency problems (Q2819598):
Displaying 14 items.
- Polynomial time algorithms for some minimum latency problems (Q294831) (← links)
- Two improved formulations for the minimum latency problem (Q346133) (← links)
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- On the minimum delay problem (Q799552) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- News from the online traveling repairman. (Q1401247) (← links)
- A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
- The minimum latency problem (Q2817608) (← links)
- Minimization of the total completion time for asynchronous transmission in a packet data-transmission system (Q3587069) (← links)
- Approximation Schemes for Minimum Latency Problems (Q4429687) (← links)
- An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)
- (Q5417636) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
- Minimizing maximum lateness under linear deterioration (Q5928447) (← links)