Pages that link to "Item:Q3532573"

The following pages link to A Faster, Better Approximation Algorithm for the Minimum Latency Problem (Q3532573):

Displaying 12 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)
• The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
• Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
• On combining machine learning with decision making (Q2512894) (← links)
• Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← 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)