An algorithm for the disjunctively constrained knapsack problem

ISSN： 1745-7645

Source： International Journal of Operational Research, Vol.13, Iss.1, 2012-12, pp. : 22-43

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 Knapsack Problem with Setup

By Yang Yanchun Bulfin Robert L.

International Journal of Operational Research, Vol. 5, Iss. 3, 2009-05 ,pp. : 280-291

Inderscience Publishers

Access to resources Recommend Favorite

Stochastic simulation-based genetic algorithm for chance constrained fractional programming problem

By Udhayakumar A. Charles Vincent Uthariaraj V. Rhymend

International Journal of Operational Research, Vol. 9, Iss. 1, 2010-08 ,pp. : 23-38

Inderscience Publishers

Access to resources Recommend Favorite

Diversity guided genetic algorithm to solve the resource constrained project scheduling problem

By Ismail Israa' Y.

International Journal of Planning and Scheduling, Vol. 1, Iss. 3, 2012-10 ,pp. : 147-170

Inderscience Publishers

Access to resources Recommend Favorite

Hybrid algorithms for the Multiple-choice Multi-dimensional Knapsack Problem

By Cherfi Nawal Hifi Mhand

International Journal of Operational Research, Vol. 5, Iss. 1, 2009-04 ,pp. : 89-109

Inderscience Publishers

Access to resources Recommend Favorite

New greedy heuristics for the Multiple-choice Multi-dimensional Knapsack Problem

By Hiremath Chaitr S. Hill Raymond R.

International Journal of Operational Research, Vol. 2, Iss. 4, 2007-06 ,pp. : 495-512

Inderscience Publishers

Access to resources Recommend Favorite