scientific article; zbMATH DE number 871910

MaRDI QIDQ4875179zbMATH OpenFDO

Authors Michel X. Goemans, Jon M. Kleinberg

Publication date 16 September 1996

zbMATH Keywords

delivery-man problemminimum latency problemtraveling repairman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• An improved approximation ratio for the minimum latency problem
• The minimum latency problem
• Approximation Schemes for Minimum Latency Problems
• Approximation schemes for minimum latency problems

Cited in

(27)

• Approximation algorithms for maximum latency and partial cycle cover
• An improved approximation ratio for the minimum latency problem
• A constant-factor approximation algorithm for the \(k\)-MST problem
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• News from the online traveling repairman.
• New algorithms for related machines with temporary jobs.
• A simple and effective metaheuristic for the minimum latency problem
• A metaheuristic for the delivery man problem with time windows
• Improved approximation algorithms for the spanning star forest problem
• Approximating the \(k\)-traveling repairman problem with repair times
• Incremental medians via online bidding
• scientific article; zbMATH DE number 1688368 (Why is no real title available?)
• The minimum latency problem
• Approximation schemes for minimum latency problems
• Polynomial time algorithms for some minimum latency problems
• Two improved formulations for the minimum latency problem
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• The Directed Minimum Latency Problem
• Approximation Schemes for Minimum Latency Problems
• scientific article; zbMATH DE number 2079325 (Why is no real title available?)
• scientific article; zbMATH DE number 2086925 (Why is no real title available?)
• scientific article; zbMATH DE number 2090008 (Why is no real title available?)
• On-line load balancing for related machines
• An efficient two-phase metaheuristic algorithm for the time dependent traveling salesman problem
• scientific article; zbMATH DE number 6297719 (Why is no real title available?)
• Pricing commodities
• Minimizing latency of capacitated \(k\)-tours

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875179)