scientific article; zbMATH DE number 1775420

MaRDI QIDQ4542553zbMATH OpenFDO

Authors Samir Khuller, Balaji Raghavachari, Moses Charikar

Publication date 1 August 2002

zbMATH Keywords

delivery problemstraveling salesman problemvehicle routing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial optimization (90C27)

Recommendations

• Algorithms for capacitated vehicle routing
• Algorithms and Data Structures
• Approximating Capacitated Routing and Delivery Problems
• Capacitated vehicle routing with nonuniform speeds
• k-delivery traveling salesman problem on tree networks

Cited in

(12)

• The \(k\)-delivery traveling salesman problem: revisited
• The pyramidal capacitated vehicle routing problem
• Algorithms for capacitated vehicle routing
• Capacitated vehicle routing with nonuniform speeds
• Vehicle Routing Algorithms for Radially Escaping Targets
• k-delivery traveling salesman problem on tree networks
• Nonpreemptive Ensemble Motion Planning on a Tree
• Preemptive Ensemble Motion Planning on a Tree
• Multiple Capacity Vehicle Routing on Paths
• Approximating Capacitated Routing and Delivery Problems
• Theoretical Computer Science
• Semi-preemptive routing on a linear and circular track

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 Q4542553)