Approximation algorithms for the Transportation Problem with Market Choice and related models
Data Structures and Algorithms
2016-08-23 v1
Abstract
Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the clients into unserved clients, paying the penalties, and into served clients, paying the transportation cost to serve them. We give polynomial-time reductions from this problem and variants to the (un)capacitated facility location problem, directly yielding approximation algorithms, two with constant factors in the metric case, one with a logarithmic factor in the general case.
Cite
@article{arxiv.1410.1409,
title = {Approximation algorithms for the Transportation Problem with Market Choice and related models},
author = {Karen Aardal and Pierre Le Bodic},
journal= {arXiv preprint arXiv:1410.1409},
year = {2016}
}