Author： Vasquez Michel Hao Jin-Kao
Publisher： Edp Sciences
E-ISSN： 1290-3868|35|4|415-438
ISSN： 0399-0559
Source： RAIRO - Operations Research, Vol.35, Iss.4, 2010-03, pp. : 415-438
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
We present, in this article, a hybrid approach forsolvingthe 0–1 multidimensional knapsack problem (MKP). This approach combineslinearprogramming and Tabu search.The resulting algorithm improves on the best result on many well-knownhard benchmarks.
Related content
Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
RAIRO - Operations Research, Vol. 37, Iss. 4, 2010-03 ,pp. :
Access to resources
Recommend
