2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
From MaRDI portal
(Redirected from Publication:1406038)
Recommendations
- scientific article; zbMATH DE number 1875418
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
- scientific article; zbMATH DE number 2080977
- Approximation algorithms for the multi-vehicle scheduling problem
- A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1486639 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
- Complexity Of The Single Vehicle Scheduling Problem On Graphs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Routing and Scheduling on a Shoreline with Release Times
- Sales‐delivery man problems on treelike networks
- Single-vehicle scheduling with time window constraints
- Special cases of traveling salesman and repairman problems with time windows
- Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
- VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
- Vehicle scheduling on a tree with release and handling times
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
Cited in
(23)- Linear time approximation schemes for vehicle scheduling problems
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
- Approximation results for a min-max location-routing problem
- A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
- Improved algorithms for single vehicle scheduling on tree/cycle networks
- scientific article; zbMATH DE number 2080977 (Why is no real title available?)
- Routing open shop and flow shop scheduling problems
- Scheduling on a graph with release times
- New LP relaxations for minimum cycle/path/tree cover problems
- Minmax Tree Cover in the Euclidean Space
- Approximation algorithms for min-max path cover problems with service handling time
- Vehicle routing problems on a line-shaped network with release time constraints
- Dynamic traveling repair problem with an arbitrary time window
- Minmax subtree cover problem on cacti
- Data mule scheduling on a path with handling time and time span constraints
- Approximation algorithms for the multi-vehicle scheduling problem
- Approximating the minmax rooted-tree cover in a tree
- Better approximability results for min-max tree/cycle/path cover problems
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
- Approximating a vehicle scheduling problem with time windows and handling times
- Single-vehicle scheduling problems with release and service times on a line
- scientific article; zbMATH DE number 1875418 (Why is no real title available?)
- Vehicle scheduling problems with two agents on a line
This page was built for publication: 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406038)
