Pages that link to "Item:Q1290636"

The following pages link to An improved approximation ratio for the minimum latency problem (Q1290636):

Displaying 33 items.

• Heuristics for the traveling repairman problem with profits (Q336352) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• Incremental facility location problem and its competitive algorithms (Q604759) (← 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)
• Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
• On the power of lookahead in on-line server routing problems (Q959800) (← links)
• A new formulation for the traveling deliveryman problem (Q1003469) (← links)
• Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
• Improved bounds for randomized preemptive online matching (Q1706142) (← links)
• Discounted reward TSP (Q1709577) (← links)
• Minimizing latency in post-disaster road clearance operations (Q1740563) (← links)
• The expanding search ratio of a graph (Q1741496) (← links)
• Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← 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)
• Solving the traveling repairman problem with profits: a novel variable neighborhood search approach (Q1999008) (← links)
• General bounds for incremental maximization (Q2118105) (← 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)
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
• Incremental medians via online bidding (Q2482726) (← links)
• A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
• On combining machine learning with decision making (Q2512894) (← links)
• Approximation algorithms for the a priori traveling repairman (Q2661528) (← links)
• Routing multiple work teams to minimize latency in post-disaster road network restoration (Q2670582) (← links)
• Routing Under Uncertainty: The a priori Traveling Repairman Problem (Q3453299) (← links)
• The Directed Minimum Latency Problem (Q3541796) (← links)
• A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems (Q5058125) (← links)
• An Improved Online Algorithm for the Traveling Repairperson Problem on a Line (Q5092364) (← links)
• Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)