Approximation results for min-max path cover problems in vehicle routing
From MaRDI portal
Publication:3065634
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)
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
- Approximating the minmax rooted-tree cover in a tree
- Approximation algorithms for some vehicle routing problems
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
- Approximation hardness of min-max tree covers
- Approximations for minimum and min-max vehicle routing problems
- Bounds and Heuristics for Capacitated Routing Problems
- Combinatorial optimization. Theory and algorithms.
- Min-max tree covers of graphs.
- On the approximability of the traveling salesman problem
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
Cited in
(21)- Improved approximation algorithms for min-max and minimum vehicle routing problems
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- Star routing: between vehicle routing and vertex cover
- 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
- Minimum makespan vehicle routing problem with compatibility constraints
- 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
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- A min-max vehicle routing problem with split delivery and heterogeneous demand
- Scheduling on a graph with release times
- 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
- Min-max cover of a graph with a small number of parts
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)
