A simulated annealing heuristic for the facility location problem

Author： Nasab Hasan Hosseini   Mobasheri Fatemeh  

Publisher： Inderscience Publishers

ISSN： 2040-3607

Source： International Journal of Mathematical Modelling and Numerical Optimisation, Vol.4, Iss.3, 2013-09, pp. : 210-224

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

Analysis of a Local Search Heuristic for Facility Location Problems

By Korupolu M.R.   Plaxton C.G.   Rajaraman R.  

Journal of Algorithms, Vol. 37, Iss. 1, 2000-10 ,pp. : 146-188

Academic Press

Access to resources Recommend Favorite

Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization

By Hedar Abdel-Rahman   Fukushima Masao  

Optimization Methods and Software, Vol. 19, Iss. 3-4, 2004-06 ,pp. : 291-308

Taylor & Francis Ltd

Access to resources Recommend Favorite

A simulated annealing algorithm for the maximum planar subgraph problem

By Poranen T.  

International Journal of Computer Mathematics, Vol. 81, Iss. 5, 2004-05 ,pp. : 555-568

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

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