Approximation results for min-max path cover problems in vehicle routing
DOI10.1002/NAV.20434zbMATH Open1202.90040OpenAlexW2055845740MaRDI QIDQ3065634FDOQ3065634
Chung-Lun Li, Zhou Xu, Liang Xu
Publication date: 6 January 2011
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20434
Recommendations
- Approximation algorithms for min-max path cover problems with service handling time
- Approximations for minimum and min-max vehicle routing problems
- Min-max cover of a graph with a small number of parts
- Approximation results for a min-max location-routing problem
- Improved approximation algorithms for min-max and minimum vehicle routing problems
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for some vehicle routing problems
- Bounds and Heuristics for Capacitated Routing Problems
- Min-max tree covers of graphs.
- On the approximability of the traveling salesman problem
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
- Approximating the minmax rooted-tree cover in a tree
- Approximations for minimum and min-max vehicle routing problems
- Combinatorial optimization. Theory and algorithms.
- Approximation hardness of min-max tree covers
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
Cited In (18)
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- New approximation algorithms for the rooted budgeted cycle cover problem
- Approximation algorithms for min-max path cover problems with service handling time
- Vehicle routing with subtours
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems
- Approximation results for a min-max location-routing problem
- Better approximability results for min-max tree/cycle/path cover problems
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
- A multi‐vehicle covering tour problem with speed optimization
- New approximation algorithms for the rooted budgeted cycle cover problem
- Scheduling on a graph with release times
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- A min-max vehicle routing problem with split delivery and heterogeneous demand
- Approximations for minimum and min-max vehicle routing problems
- Approximation algorithms for solving the trip-constrained vehicle routing cover problems
- New approximation algorithms for the minimum cycle cover problem
- Minimum Vehicle Routing with a Common Deadline
- Approximation algorithms for some minimum postmen cover problems
Uses Software
This page was built for publication: Approximation results for min-max path cover problems in vehicle routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065634)
