Scheduling vehicles on trees

MaRDI QIDQ3368663zbMATH OpenFDO

Authors Yoshiyuki Karuno, Hiroshi Nagamochi

Publication date 8 February 2006

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Linear time approximation schemes for vehicle scheduling problems
• scientific article; zbMATH DE number 2089206
• Vehicle scheduling on a tree with release and handling times
• scientific article; zbMATH DE number 2080977
• Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle

Cited in

(6)

• Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case
• Better approximation ratios for the single-vehicle scheduling problems on tree/cycle networks
• Approximating the minmax rooted-tree cover in a tree
• Approximating a vehicle scheduling problem with time windows and handling times
• scientific article; zbMATH DE number 2089206 (Why is no real title available?)
• Minmax Tree Cover in the Euclidean Space

This page was built for publication: Scheduling vehicles on trees

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