Concave connection cost facility location and the star inventory routing problem
From MaRDI portal
Publication:2117697
DOI10.1007/978-3-030-80879-2_12OpenAlexW3185124824MaRDI QIDQ2117697
Jaroslaw Byrka, Mateusz Lewandowski
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/1912.00770
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for inventory problems with submodular or routing costs
- Approximation algorithms for supply chain planning and logistics problems with market choice
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- Inventory Routing problem with facility location
- Dynamic Version of the Economic Lot Size Model
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty
- Proportional Approval Voting, Harmonic k-median, and Negative Association
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
This page was built for publication: Concave connection cost facility location and the star inventory routing problem
