Approximation algorithms for the stochastic priority facility location problem

ISSN： 0233-1934

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

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 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

Incremental Facility Location Problem and Its Competitive Algorithms

By Dai Wenqiang Zeng Xianju

Journal of Combinatorial Optimization, Vol. 20, Iss. 3, 2010-10 ,pp. : 307-320

Springer Publishing Company

Access to resources Recommend Favorite

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

By Du Donglei Wang Xing Xu Dachuan

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

Springer Publishing Company

Access to resources Recommend Favorite

A per-scenario bound for the two-stage stochastic facility location problem with linear penalty

By Wu Chenchen Du Donglei Xu Dachuan

Optimization, Vol. 63, Iss. 6, 2014-06 ,pp. : 921-930

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximation Algorithms for the Class Cover Problem

By Cannon Adam H.

Annals of Mathematics and Artificial Intelligence, Vol. 40, Iss. 3-4, 2004-03 ,pp. : 215-223

Springer Publishing Company

Access to resources Recommend Favorite