Bifactor approximation for location routing with vehicle and facility capacities
From MaRDI portal
Publication:2171591
Recommendations
Cites work
- A (slightly) improved approximation algorithm for metric TSP
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A 3-approximation algorithm for the facility location problem with uniform capacities
- A 5-approximation for capacitated facility location
- A survey of recent research on location-routing problems
- A survey of the standard location-routing problem
- A survey of variants and extensions of the location-routing problem
- A two-phase tabu search approach to the location routing problem
- An approximation algorithm for the generalized assignment problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Analysis of a Local Search Heuristic for Facility Location Problems
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- Consistency and robustness in location-routing
- Cost-effective designs of fault-tolerant access networks in communication systems
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- scientific article; zbMATH DE number 3153591 (Why is no real title available?)
- LP-based algorithms for capacitated facility location
- LP-based approximation algorithms for capacitated facility location
- Single source unsplittable flows with arc-wise lower and upper bounds
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- The design of approximation algorithms
- The effect of ignoring routes when locating depots
- The granular tabu search and its application to the vehicle-routing problem
- The vehicle routing problem. Latest advances and new challenges.
- Using clustering analysis in a capacitated location-routing problem
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
Cited in
(4)- Improved approximation algorithms for multidepot capacitated vehicle routing
- Multidepot capacitated vehicle routing with improved approximation guarantees
- Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems
- Enhanced approximation algorithms for the capacitated location routing problem
This page was built for publication: Bifactor approximation for location routing with vehicle and facility capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2171591)
