Pages that link to "Item:Q3532573"
From MaRDI portal
The following pages link to A Faster, Better Approximation Algorithm for the Minimum Latency Problem (Q3532573):
Displaying 6 items.
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- A 16-competitive algorithm for hierarchical median problem (Q893690) (← links)
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)
