A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.33, Iss.2-3, 2006-03, pp. : 271-285

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

A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem

By Sbihi Abdelkader

Journal of Combinatorial Optimization, Vol. 13, Iss. 4, 2007-05 ,pp. : 337-351

Springer Publishing Company

Access to resources Recommend Favorite

A generalisation of an algorithm solving the fuzzy multiple choice knapsack problem

By Kuchta D.

Fuzzy Sets and Systems, Vol. 127, Iss. 2, 2002-04 ,pp. : 131-140

Elsevier

Access to resources Recommend Favorite

An exact algorithm for the budget-constrained multiple knapsack problem

By You Byungjun Yamada Takeo

International Journal of Computer Mathematics, Vol. 88, Iss. 16, 2011-11 ,pp. : 3380-3393

Taylor & Francis Ltd

Access to resources Recommend Favorite

Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints

International Journal of Computer Mathematics, Vol. 91, Iss. 12, 2014-12 ,pp. : 2470-2482

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the number of local minima for the multidimensional assignment problem

By Grundel Don Krokhmal Pavlo Oliveira Carlos Pardalos Panos

Journal of Combinatorial Optimization, Vol. 13, Iss. 1, 2007-01 ,pp. : 1-18

Springer Publishing Company

Access to resources Recommend Favorite