An approximation algorithm for the k-level capacitated facility location problem

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.20, Iss.4, 2010-11, pp. : 361-368

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A cutting plane algorithm for the capacitated facility location problem

By Avella Pasquale Boccia Maurizio

Computational Optimization and Applications, Vol. 43, Iss. 1, 2009-05 ,pp. : 39-65

Springer Publishing Company

Access to resources Recommend Favorite

An approximation algorithm for k-center problem on a convex polygon

By Du Hai Xu Yinfeng

Journal of Combinatorial Optimization, Vol. 27, Iss. 3, 2014-04 ,pp. : 504-518

Springer Publishing Company

Access to resources Recommend Favorite

A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties

Optimization, Vol. 64, Iss. 3, 2015-03 ,pp. : 617-626

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximation algorithms for the stochastic priority facility location problem

By Li Gaidi Wang Zhen Wu Chenchen

Optimization, Vol. 62, Iss. 7, 2013-07 ,pp. : 919-928

Taylor & Francis Ltd

Access to resources Recommend Favorite

An Improved Approximation Algorithm for Multicast k-Tree Routing

By Lin Guohui

Journal of Combinatorial Optimization, Vol. 9, Iss. 4, 2005-06 ,pp. : 349-356

Springer Publishing Company

Access to resources Recommend Favorite