Enhanced approximation algorithms for the capacitated location routing problem

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 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
A 5-approximation for capacitated facility location
A (3/2+)-approximation for multiple TSP with a variable number of depots
A better-than-1.6-approximation for prize-collecting TSP
A biased-randomized metaheuristic for the capacitated location routing problem
A Branch-and-Cut method for the Capacitated Location-Routing Problem
A deterministic better-than-3/2 approximation algorithm for metric TSP
A General Approximation Technique for Constrained Forest Problems
A GRASP\(\times \)ELS approach for the capacitated location-routing problem
A progressive filtering heuristic for the location-routing problem and variants
A simple and effective evolutionary algorithm for the capacitated location-routing problem
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 adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem
An effective implementation of the Lin-Kernighan traveling salesman heuristic
An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
An exact method for the capacitated location-routing problem
An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
Approximation algorithms for group prize-collecting and location-routing problems
Approximation Algorithms for Problems Combining Facility Location and Network Design
Bifactor approximation for location routing with vehicle and facility capacities
Bounds and Heuristics for Capacitated Routing Problems
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Heuristic analysis, linear programming and branch and bound
Heuristics for unequal weight delivery problems with a fixed error guarantee
scientific article; zbMATH DE number 3746840 (Why is no real title available?)
scientific article; zbMATH DE number 7646025 (Why is no real title available?)
Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
Improved approximation algorithms for the facility location problems with linear/submodular penalties
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
Improved approximations for capacitated vehicle routing with unsplittable client demands
Improving the approximation ratio for capacitated vehicle routing
Locating depots for capacitated vehicle routing
LP-based algorithms for capacitated facility location
Multidepot capacitated vehicle routing with improved approximation guarantees
Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems
Reducing Path TSP to TSP
Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
Steiner tree approximation via iterative randomized rounding
The design of approximation algorithms
Using clustering analysis in a capacitated location-routing problem
Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands
Vehicle Routing
Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems

This page was built for publication: Enhanced approximation algorithms for the capacitated location routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7286069)