The following pages link to The minimum latency problem (Q2817608):
Displaying 50 items.
- Polynomial time algorithms for some minimum latency problems (Q294831) (← links)
- Maintenance scheduling of geographically distributed assets with prognostics information (Q319618) (← links)
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
- Heuristics for the traveling repairman problem with profits (Q336352) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
- Query strategies for priced information (Q696973) (← links)
- The A priori traveling repairman problem (Q722527) (← links)
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- Exact algorithms for the minimum latency problem (Q834971) (← links)
- Profit-based latency problems on the line (Q943793) (← links)
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
- News from the online traveling repairman. (Q1401247) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- The multi-vehicle cumulative covering tour problem (Q1686527) (← links)
- A performance study on multi improvement neighborhood search strategy (Q1687681) (← links)
- From theory to practice: maximizing revenues for on-line dial-a-ride (Q1702834) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- A truck and drones model for last-mile delivery: a mathematical model and heuristic approach (Q1988950) (← links)
- The Chinese deliveryman problem (Q2025136) (← links)
- A metaheuristic for the delivery man problem with time windows (Q2045024) (← links)
- Finding the maximum multi improvement on neighborhood exploration (Q2070118) (← links)
- The multi-depot \(k\)-traveling repairman problem (Q2091220) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
- A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones (Q2147137) (← links)
- Counting and optimising maximum phylogenetic diversity sets (Q2161386) (← links)
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems (Q2164695) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem (Q2174909) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits (Q2273692) (← links)
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits (Q2289922) (← links)
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
- A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications (Q2420657) (← links)
- Routing vehicles to minimize fuel consumption (Q2450732) (← links)
- Approximating the \(k\)-traveling repairman problem with repair times (Q2457300) (← links)
