New LP relaxations for minimum cycle/path/tree cover problems
From MaRDI portal
Publication:2283007
DOI10.1016/j.tcs.2019.05.041zbMath1436.90147OpenAlexW2954210179WikidataQ127575553 ScholiaQ127575553MaRDI QIDQ2283007
Xiaoguang Bao, Zhaohui Liu, Wei Yu
Publication date: 27 December 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.05.041
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (2)
An overview of graph covering and partitioning ⋮ Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
Uses Software
Cites Work
- Unnamed Item
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Min-max tree covers of graphs.
- Approximation results for a min-max location-routing problem
- The vehicle routing problem. Latest advances and new challenges.
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
- The Vehicle Routing Problem
- Approximation algorithms for distance constrained vehicle routing problems
- Approximation Algorithms for Min-Max Cycle Cover Problems
- Approximation Algorithms for the Multi-Vehicle Scheduling Problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Minimum Vehicle Routing with a Common Deadline
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- Approximations for minimum and min-max vehicle routing problems
- Minmax Tree Cover in the Euclidean Space
- New approximation algorithms for the minimum cycle cover problem
This page was built for publication: New LP relaxations for minimum cycle/path/tree cover problems
