A dynamic programming algorithm for the travelling repairman problem

MaRDI QIDQ3363089zbMATH OpenFDO

Authors Cheng'en Yang

Publication date 1989

zbMATH Keywords

deadlinesminimizing the maximum latenesspolynomial algorithms

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Programming involving graphs or networks (90C35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The complexity of the travelling repairman problem
• A note on the traveling repairman problem
• Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
• Solving the traveling repairman problem on a line with general processing times and deadlines
• On-line algorithms for the dynamic traveling repair problem

Cited in

(7)

• Product warranty logistics: issues and challenges.
• On-line algorithms for the dynamic traveling repair problem
• Solving the traveling repairman problem on a line with general processing times and deadlines
• The complexity of the travelling repairman problem
• scientific article; zbMATH DE number 2166451 (Why is no real title available?)
• A note on the traveling repairman problem
• Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.

This page was built for publication: A dynamic programming algorithm for the travelling repairman problem

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