An LP-based metaheuristic procedure for the k-sequential generalized assignment problem

Author： French A. P.   Nygreen B.   Wilson J. M.  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.26, Iss.2, 2011-04, pp. : 225-238

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 Hybrid Metaheuristic for the Quadratic Assignment Problem

By Tseng Lin-Yu   Liang Shyi-Ching  

Computational Optimization and Applications, Vol. 34, Iss. 1, 2006-05 ,pp. : 85-113

Springer Publishing Company

Access to resources Recommend Favorite

Generalized cover facet inequalities for the generalized assignment problem

By Gottlieb Elsie Sterbin  

Optimization, Vol. 59, Iss. 2, 2010-02 ,pp. : 223-233

Taylor & Francis Ltd

Access to resources Recommend Favorite

Independent and cooperative parallel search methods for the generalized assignment problem

By Asahiro Yuichi   Ishibashi Masahiro   Yamashita Masafumi  

Optimization Methods and Software, Vol. 18, Iss. 2, 2003-04 ,pp. : 129-141

Taylor & Francis Ltd

Access to resources Recommend Favorite

Hybrid Population-Based Algorithms for the Bi-Objective Quadratic Assignment Problem

By López-Ibáñez Manuel   Paquete Luís   Stützle Thomas  

Journal of Mathematical Modelling and Algorithms, Vol. 5, Iss. 1, 2006-04 ,pp. : 111-137

Springer Publishing Company

Access to resources Recommend Favorite

A simplex-based labelling algorithm for the linear fractional assignment problem

By  

Optimization, Vol. 64, Iss. 4, 2015-04 ,pp. : 929-939

Taylor & Francis Ltd

Access to resources Recommend Favorite