Approximation results for a min-max location-routing problem
DOI10.1016/J.DAM.2011.09.014zbMATH Open1238.90021OpenAlexW2008850276MaRDI QIDQ765374FDOQ765374
Wenbin Zhu, Zhou Xu, Dongsheng Xu
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.09.014
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Combined location-routing problems: A synthesis and future research directions
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- Location-routing: issues, models and methods
- Minmax \(p\)-traveling salesmen location problems on a tree
- Min-max tree covers of graphs.
- Approximating the minmax rooted-tree cover in a tree
- Approximation results for min-max path cover problems in vehicle routing
- Approximations for minimum and min-max vehicle routing problems
- Combinatorial optimization. Theory and algorithms.
- Title not available (Why is that?)
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
- 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 (15)
- A taxonomical analysis, current methods and objectives on location-routing problems
- An overview of graph covering and partitioning
- Approximation algorithms for some extensions of the maximum profit routing problem
- New approximation algorithms for the rooted budgeted cycle cover problem
- A survey of recent research on location-routing problems
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems
- New LP relaxations for minimum cycle/path/tree cover problems
- Better approximability results for min-max tree/cycle/path cover problems
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
- 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
- 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
This page was built for publication: Approximation results for a min-max location-routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765374)
