Bifactor approximation for location routing with vehicle and facility capacities
From MaRDI portal
Publication:2171591
DOI10.1016/j.ejor.2022.04.028OpenAlexW3192199234WikidataQ114184272 ScholiaQ114184272MaRDI QIDQ2171591
Antonia Demleitner, Oscar F. Carrasco Heine, Jannik Matuschke
Publication date: 9 September 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.02480
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of recent research on location-routing problems
- A 3-approximation algorithm for the facility location problem with uniform capacities
- LP-based approximation algorithms for capacitated facility location
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Using clustering analysis in a capacitated location-routing problem
- The vehicle routing problem. Latest advances and new challenges.
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- The effect of ignoring routes when locating depots
- An approximation algorithm for the generalized assignment problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A two-phase tabu search approach to the location routing problem
- A survey of the standard location-routing problem
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A survey of variants and extensions of the location-routing problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A 5-Approximation for Capacitated Facility Location
- LP-Based Algorithms for Capacitated Facility Location
- The Design of Approximation Algorithms
- Cost-effective designs of fault-tolerant access networks in communication systems
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- Analysis of a Local Search Heuristic for Facility Location Problems
- Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- A (slightly) improved approximation algorithm for metric TSP
This page was built for publication: Bifactor approximation for location routing with vehicle and facility capacities
