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

Author： Hiremath Chaitr S.   Hill Raymond R.  

Publisher： Inderscience Publishers

ISSN： 1745-7645

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

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

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

The problem of rape in India: a multi-dimensional analysis

By Sharma Radha R.   Pardasani Rupali   Nandram Sharda  

International Journal of Managing Projects in Business, Vol. 7, Iss. 3, 2014-05 ,pp. : 362-379

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Quality assurance of multiple-choice tests

By Bush Martin E.  

Quality Assurance in Education, Vol. 14, Iss. 4, 2006-10 ,pp. : 398-404

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Two heuristics to the share-of-choice product line design problem

By Wang Xinfang  

International Journal of Operational Research, Vol. 10, Iss. 2, 2011-02 ,pp. : 180-193

Inderscience Publishers

Access to resources Recommend Favorite

A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem

By Layeb Abdesslem  

International Journal of Operational Research, Vol. 17, Iss. 4, 2013-06 ,pp. : 509-525

Inderscience Publishers

Access to resources Recommend Favorite