Approximation algorithms for the transportation problem with market choice and related models

Aggarwal, 2010, A 3-approximation for facility location with uniform capacities, vol. 6080, 149 Ahuja, 1993 Hyung-Chan An, Mohit Singh, Svensson, LP-based algorithms for capacitated facility location, 2014. http://arxiv.org/abs/1407.3263. Ausiello, 2006, Reductions, completeness and the hardness of approximability, European J. Oper. Res., 172, 719, 10.1016/j.ejor.2005.06.006 Bansal, 2012, A 5-approximation for capacitated facility location, vol. 7501, 133 Bar-Ilan, 2001, Generalized submodular cover problems and applications, Theoret. Comput. Sci., 250, 179, 10.1016/S0304-3975(99)00130-9 Byrka, 2010, An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem, SIAM J. Comput., 39, 2212, 10.1137/070708901 Chudak, 2003, Improved approximation algorithms for the uncapacitated facility location problem, SIAM J. Comput., 33, 1, 10.1137/S0097539703405754 Chudak, 2005, Improved approximation algorithms for capacitated facility location problems, Math. Program., 102, 207, 10.1007/s10107-004-0524-9 Damci-Kurt, 2013, On the transportation problem with market choice, Discrete Appl. Math. Garey, 1979 Geunes, 2011, Approximation algorithms for supply chain planning and logistics problems with market choice, Math. Program., 130, 85, 10.1007/s10107-009-0310-9 Guha, 1999, Greedy strikes back: improved facility location algorithms, J. Algorithms, 31, 228, 10.1006/jagm.1998.0993 Hochbaum, 1982, Heuristics for the fixed cost median problem, Math. Program., 22, 148, 10.1007/BF01581035 Kantorovich, 1960, Mathematical methods of organizing and planning production, Manage. Sci., 6, 366, 10.1287/mnsc.6.4.366 Korupolu, 2000, Analysis of a local search heuristic for facility location problems, J. Algorithms, 37, 146, 10.1006/jagm.2000.1100 Kuehn, 1963, A heuristic program for locating warehouses, Manage. Sci., 9, 643, 10.1287/mnsc.9.4.643 Li, 2013, A 1.488 approximation algorithm for the uncapacitated facility location problem, Inform. and Comput., 222, 45, 10.1016/j.ic.2012.01.007 Li, 2013, Improved approximation algorithms for the facility location problems with linear/submodular penalty, vol. 7936, 292 Mahdian, 2003, Universal facility location, vol. 2832, 409 Mahdian, 2006, Approximation algorithms for metric facility location problems, SIAM J. Comput., 36, 411, 10.1137/S0097539703435716 1990, 119 Noga, 2006, Algorithmic construction of sets for k-restrictions, ACM Trans. Algorithms, 2, 153, 10.1145/1150334.1150336 Pál, 2001, Facility location with nonuniform hard capacities, 329 C.H. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes (extended abstract), in: STOC, 1988, pp. 229–234. D.B. Shmoys, Approximation algorithms for facility location problems, in: APPROX, 2000, pp. 27–33. Zhang, 2005, A multiexchange local search algorithm for the capacitated facility location problem, Math. Oper. Res., 30, 389, 10.1287/moor.1040.0125