2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
type: Item
instance of: scholarly article
title: 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
zbMATH Open document ID: 1034.68122
DOI: 10.1016/S0166-218X(02)00596-6
author: Yoshiyuki Karuno
author: Hiroshi Nagamochi
published in: Discrete Applied Mathematics
publication date: 2003-09-09T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 1977909
zbMATH Keywords: performance guarantee
MaRDI profile type: Publication
cites work: A new approximation algorithm for the capacitated vehicle routing problem on a tree
cites work: Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
cites work: Sales‐delivery man problems on treelike networks
cites work: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
cites work: \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
cites work: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
cites work: Vehicle scheduling on a tree with release and handling times
cites work: Q4494938
cites work: Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
cites work: Q5187226
cites work: Complexity Of The Single Vehicle Scheduling Problem On Graphs
cites work: Routing and Scheduling on a Shoreline with Release Times
cites work: Special cases of traveling salesman and repairman problems with time windows
cites work: Single-vehicle scheduling with time window constraints
description: scientific article; zbMATH DE number 1977909