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

ISSN： 1382-6905

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

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 Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem

By Hifi M. Michrafy M. Sbihi A.

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

Springer Publishing Company

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

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

Heuristic and Exact Algorithms for the Precedence-Constrained Knapsack Problem

By Samphaiboon N. Yamada Y.

Journal of Optimization Theory and Applications, Vol. 105, Iss. 3, 2000-06 ,pp. : 659-676

Springer Publishing Company

Access to resources Recommend Favorite

KBFS: K-Best-First Search

By Felner A.

Annals of Mathematics and Artificial Intelligence, Vol. 39, Iss. 1-2, 2003-09 ,pp. : 19-39

Springer Publishing Company

Access to resources Recommend Favorite