Two Algorithms for the Multi-Weber Problem

Author： Harris B.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.123, Iss.1-4, 2003-10, pp. : 37-52

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

Parallel algorithms for a multi-level network optimization problem

By Mateus† G.R.  

Parallel Algorithms and Applications, Vol. 18, Iss. 3, 2003-09 ,pp. : 121-137

Taylor & Francis Ltd

Access to resources Recommend Favorite

Multi-objective genetic algorithms for flights amalgamation problem

By Waheed Mohamed Elsayed   Makhlouf Mohamed Abd Allah  

International Journal of Computer Applications in Technology, Vol. 45, Iss. 4, 2012-12 ,pp. : 254-265

Inderscience Publishers

Access to resources Recommend Favorite

Ordered Incremental Multi-Objective Problem Solving Based on Genetic Algorithms

By  

International Journal of Applied Evolutionary Computation (IJAEC), Vol. 1, Iss. 2, 2010-04 ,pp. : 1-27

IGI Global_journal

Access to resources Recommend Favorite

RETRACTED ARTICLE: Two efficient algorithms for a quay crane scheduling and assignment problem

By Tavakkoli-Moghaddam R.   Taheri F.   Bazzazi M.   Salahi S.  

Journal of Intelligent Manufacturing, Vol. 21, Iss. 4, 2010-08 ,pp. : 591-591

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems

By Detti Paolo   Agnetis Alessandro   Ciaschetti Gianfranco  

Journal of Scheduling, Vol. 8, Iss. 3, 2005-06 ,pp. : 255-273

Springer Publishing Company

Access to resources Recommend Favorite