Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints

DOI10.1016/j.ipl.2022.106299OpenAlexW4284674219WikidataQ114167069 ScholiaQ114167069MaRDI QIDQ2169436

Zhaohui Liu, Wei Yu

Publication date: 2 September 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106299

zbMATH Keywords

polynomial algorithmsapproximation algorithmshandling timedata mule schedulingtime span constraint

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• The multiple traveling salesman problem on spiders
• Approximation hardness of min-max tree covers
• A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
• Data mule scheduling on a path with handling time and time span constraints
• A framework for vehicle routing approximation schemes in trees
• Better approximability results for min-max tree/cycle/path cover problems
• Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree
• A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
• Approximation algorithms for distance constrained vehicle routing problems
• On the Distance Constrained Vehicle Routing Problem
• Algorithms and Computation
• Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing

This page was built for publication: Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints