A cutting plane algorithm for the capacitated facility location problem

ISSN： 0926-6003

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

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

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

An incremental algorithm for the uncapacitated facility location problem

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 306-311

John Wiley & Sons Inc

Access to resources Recommend Favorite

Branch-and-Cut-and-Price for Capacitated Connected Facility Location

By Leitner Markus

Journal of Mathematical Modelling and Algorithms, Vol. 10, Iss. 3, 2011-09 ,pp. : 245-267

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

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