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

Author： Kuchta D.  

Publisher： Elsevier

ISSN： 0165-0114

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

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 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

On a fuzzy set approach to solving multiple objective linear fractional programming problem

By Stancu-Minasian I.M.   Pop B.  

Fuzzy Sets and Systems, Vol. 134, Iss. 3, 2003-03 ,pp. : 397-405

Elsevier

Access to resources Recommend Favorite

A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem

By Liu Binghua   Qu Biao   Zheng Na  

Numerical Functional Analysis and Optimization, Vol. 35, Iss. 11, 2014-11 ,pp. : 1459-1466

Taylor & Francis Ltd

Access to resources Recommend Favorite