LP based heuristics for the multiple knapsack problem with assignment restrictions

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.146, Iss.1, 2006-09, pp. : 91-104

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

Improved convergent heuristics for the 0-1 multidimensional knapsack problem

By Hanafi Saïd

Annals of Operations Research, Vol. 183, Iss. 1, 2011-03 ,pp. : 125-142

Springer Publishing Company

Access to resources Recommend Favorite

Local search heuristics for the multidimensional assignment problem

By Karapetyan Daniel

Journal of Heuristics, Vol. 17, Iss. 3, 2011-06 ,pp. : 201-249

Springer Publishing Company

Access to resources Recommend Favorite

A discrete artificial bee colony for multiple Knapsack problem

By Sabet Shima Shokouhifar Mohammad Farokhi Fardad

International Journal of Reasoning-based Intelligent Systems, Vol. 5, Iss. 2, 2013-10 ,pp. : 88-95

Inderscience Publishers

Access to resources Recommend Favorite

Cost Based Filtering for the Constrained Knapsack Problem

By Fahle T.

Annals of Operations Research, Vol. 115, Iss. 1-4, 2002-09 ,pp. : 73-93

Springer Publishing Company

Access to resources Recommend Favorite

An Improved Generalized Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem

International Journal of Applied Evolutionary Computation (IJAEC), Vol. 9, Iss. 1, 2018-01 ,pp. : 17-51

IGI Global_journal

Access to resources Recommend Favorite