Concave connection cost facility location and the star inventory routing problem
From MaRDI portal
Publication:2117697
Cites work
- scientific article; zbMATH DE number 1947060 (Why is no real title available?)
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Algorithms for facility location problems with outliers. (Extended abstract)
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Approximation algorithms for inventory problems with submodular or routing costs
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for supply chain planning and logistics problems with market choice
- Dynamic version of the economic lot size model
- Greedy Strikes Back: Improved Facility Location Algorithms
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved approximation algorithms for the facility location problems with linear/submodular penalty
- Inventory Routing problem with facility location
- Proportional approval voting, harmonic \(k\)-median, and negative association
This page was built for publication: Concave connection cost facility location and the star inventory routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117697)
