Two linear approximation algorithms for the subset-sum problem

Author： Kellerer H.   Mansini R.   Speranza M.G.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.120, Iss.2, 2000-01, pp. : 289-296

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 exact algorithm for the subset sum problem

By Soma N.Y.   Toth P.  

European Journal of Operational Research, Vol. 136, Iss. 1, 2002-01 ,pp. : 57-66

Elsevier

Access to resources Recommend Favorite

Approximation algorithms for the oriented two-dimensional bin packing problem

By Lodi A.   Martello S.   Vigo D.  

European Journal of Operational Research, Vol. 112, Iss. 1, 1999-01 ,pp. : 158-166

Elsevier

Access to resources Recommend Favorite

Computational experience with approximation algorithms for the set covering problem

By Grossman T.   Wool A.  

European Journal of Operational Research, Vol. 101, Iss. 1, 1997-08 ,pp. : 81-92

Elsevier

Access to resources Recommend Favorite

A linear approximation model for the parameter design problem

By Fathi Y.  

European Journal of Operational Research, Vol. 97, Iss. 3, 1997-03 ,pp. : 561-570

Elsevier

Access to resources Recommend Favorite

Genetic algorithms for the two-stage bicriteria flowshop problem

By Neppalli V.R.   Chuen-Lung C.   Gupta J.N.D.  

European Journal of Operational Research, Vol. 95, Iss. 2, 1996-12 ,pp. : 356-373

Elsevier

Access to resources Recommend Favorite