Pages that link to "Item:Q4429687"

The following pages link to Approximation Schemes for Minimum Latency Problems (Q4429687):

Displaying 21 items.

• Polynomial time algorithms for some minimum latency problems (Q294831) (← links)
• A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
• Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
• On the minimum delay problem (Q799552) (← links)
• Exact algorithms for the minimum latency problem (Q834971) (← links)
• An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
• The expanding search ratio of a graph (Q1741496) (← 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)
• The Chinese deliveryman problem (Q2025136) (← links)
• A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
• Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
• Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683) (← links)
• Approximation algorithms for the a priori traveling repairman (Q2661528) (← links)
• Approximation schemes for minimum latency problems (Q2819598) (← links)
• Minimization of the total completion time for asynchronous transmission in a packet data-transmission system (Q3587069) (← 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)
• Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings (Q6634523) (← links)