An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem

ISSN： 0305-215X

Source： Engineering Optimization, Vol.46, Iss.8, 2014-08, pp. : 1109-1122

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

Related content

An expanding-core algorithm for the exact 0-1 Knapsack Problem

By Pisinger D.

European Journal of Operational Research, Vol. 87, Iss. 1, 1995-11 ,pp. : 175-187

Elsevier

Access to resources Recommend Favorite

An efficient tabu search approach for the 0-1 multidimensional knapsack problem

By Hanafi S. Freville A.

European Journal of Operational Research, Vol. 106, Iss. 2, 1998-04 ,pp. : 659-675

Elsevier

Access to resources Recommend Favorite

Using Chemotherapy Science Algorithm (CSA) to Solve the Knapsack Problem

International Journal of Energy Optimization and Engineering (IJEOE), Vol. 7, Iss. 1, 2018-01 ,pp. : 86-103

IGI Global_journal

Access to resources Recommend Favorite

An effective hybrid cuckoo search and genetic algorithm for constrained engineering design optimization

By Kanagaraj G. Ponnambalam S.G. Jawahar N. Nilakantan J. Mukund

Engineering Optimization, Vol. 46, Iss. 10, 2014-10 ,pp. : 1331-1351

Taylor & Francis Ltd

Access to resources Recommend Favorite

An orthogonal design based constrained evolutionary optimization algorithm

By Wang Yong

Engineering Optimization, Vol. 39, Iss. 6, 2007-09 ,pp. : 715-736

Taylor & Francis Ltd

Access to resources Recommend Favorite