Approximation Algorithms for Facility Location Problems and Other Supply Chain Problems
Resumo
Este artigo não possui resumo.
Referências
Fernandes, C. G., Meira, L. A., Miyazawa, F. K., and Pedrosa, L. L. (2014). A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Mathematical Programming, pages 1–31. In press.
Fernandes, C. G., Meira, L. A. A., Miyazawa, F. K., and Pedrosa, L. L. C. (2012). A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems. In APPROX 2012, pages 146–157.
Jain, K., Mahdian, M., Markakis, E., Saberi, A., and Vazirani, V. V. (2003). Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM, 50(6):795–824.
Jain, K. and Vazirani, V. V. (2001). Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM, 48(2):274–296.
Levi, R., Roundy, R. O., Shmoys, D. B., and Sviridenko, M. (2008). A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem. Management Science, 54(4):763–776.
Miyazawa, F., Pedrosa, L., Schouery, R., Sviridenko, M., and Wakabayashi, Y. (2014). Polynomial-Time Approximation Schemes for Circle Packing Problems. In ESA 2014, pages 713–724.
Pedrosa, L. L. C. and Sviridenko, M. (2014). Integrated Supply Chain Management via Randomized Rounding. In LATIN 2014, pages 562–573.
Wu, C., Xu, D., Du, D., and Wang, Y. (2014). An improved approximation algorithm for k-median problem using a new factor-revealing LP. Arxiv Preprint.
Fernandes, C. G., Meira, L. A. A., Miyazawa, F. K., and Pedrosa, L. L. C. (2012). A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems. In APPROX 2012, pages 146–157.
Jain, K., Mahdian, M., Markakis, E., Saberi, A., and Vazirani, V. V. (2003). Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM, 50(6):795–824.
Jain, K. and Vazirani, V. V. (2001). Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM, 48(2):274–296.
Levi, R., Roundy, R. O., Shmoys, D. B., and Sviridenko, M. (2008). A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem. Management Science, 54(4):763–776.
Miyazawa, F., Pedrosa, L., Schouery, R., Sviridenko, M., and Wakabayashi, Y. (2014). Polynomial-Time Approximation Schemes for Circle Packing Problems. In ESA 2014, pages 713–724.
Pedrosa, L. L. C. and Sviridenko, M. (2014). Integrated Supply Chain Management via Randomized Rounding. In LATIN 2014, pages 562–573.
Wu, C., Xu, D., Du, D., and Wang, Y. (2014). An improved approximation algorithm for k-median problem using a new factor-revealing LP. Arxiv Preprint.
Publicado
20/07/2015
Como Citar
PEDROSA, Lehilton; MIYAZAWA, Flávio; SVIRIDENKO, Maxim.
Approximation Algorithms for Facility Location Problems and Other Supply Chain Problems. In: CONCURSO DE TESES E DISSERTAÇÕES (CTD), 28. , 2015, Recife.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2015
.
p. 1-6.
ISSN 2763-8820.
DOI: https://doi.org/10.5753/ctd.2015.9993.
