Approximation Algorithms for the Multi-Vehicle Scheduling Problem

DOI10.1007/978-3-642-17514-5_17zbMath1311.90044OpenAlexW1601807516MaRDI QIDQ3060773

Yuzhuang Hu, Binay K. Bhattacharya

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_17

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (6)

Improved approximation algorithms for some min-max and minimum cycle cover problems ⋮ Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems ⋮ Better approximability results for min-max tree/cycle/path cover problems ⋮ Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle ⋮ New LP relaxations for minimum cycle/path/tree cover problems ⋮ Improved algorithms for single vehicle scheduling on tree/cycle networks

This page was built for publication: Approximation Algorithms for the Multi-Vehicle Scheduling Problem