Independent and cooperative parallel search methods for the generalized assignment problem

Author： Asahiro Yuichi   Ishibashi Masahiro   Yamashita Masafumi  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

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

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

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

A Tabu Search Algorithm for the Quadratic Assignment Problem

By Misevicius Alfonsas  

Computational Optimization and Applications, Vol. 30, Iss. 1, 2005-01 ,pp. : 95-111

Springer Publishing Company

Access to resources Recommend Favorite

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

By French A. P.   Nygreen B.   Wilson J. M.  

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-monge matrices

By Demidenko V.   Dolgui A.  

Cybernetics and Systems Analysis, Vol. 43, Iss. 1, 2007-01 ,pp. : 112-125

Springer Publishing Company

Access to resources Recommend Favorite

A Problem-Independent Limiter for High-Order Runge–Kutta Discontinuous Galerkin Methods

By Burbeau A.   Sagaut P.    

Journal of Computational Physics, Vol. 169, Iss. 1, 2001-05 ,pp. : 111-150

Academic Press

Access to resources Recommend Favorite