Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0-1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis of the shortcomings of the standard CS and the advantage of the global harmony search (GHS), a no...

We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its own right, the semi-continuous knapsack problem is a relaxation of general mixed-integer programming. We show how strong inequalities valid for the semi-continuous knapsack polyhedron can be derived and used in a branch...

The Extended Tree Knapsack Problem(ETKP) is a generalized version of the Tree Knapsack Problem where an arbitrary nonlinear traac-ow cost is imposed. This problem can be solved by the straightforward \bottom-up" approach with a time complexity of O(nH 2), where n is the number of nodes in the tree, and H is the knapsack capacity. In this paper, we show that if the traac-ow cost function is the ...

Problem statement: Knapsack problem is a typical NP complete problem. During last few decades, Knapsack problem has been studied through different approaches, according to the theoretical development of combinatorial optimization. Approach: In this study, modified evolutionary algorithm was presented for 0/1 knapsack problem. Results: A new objective_func_evaluation operator was proposed which ...

Recent years have witnessed a growing interest in automatic learning mechanisms and applications. The concept of hyper-heuristics, algorithms that either select among existing or generate new ones, holds high relevance this matter. Current research suggests that, under certain circumstances, hyper-heuristics outperform single heuristics when evaluated isolation. When are selected algorithms, th...

The 0/1 knapsack problem is a well-known problem, which appears in many real domains with practical importance. The problem is NP-complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. Many algorithms have been proposed in the past five decades for both single and multiobjective knapsack problems. A new versi...