Results 141 to 150 of about 417,011 (184)

On the solution of multidimensional convex separable continuous knapsack problem with bounded variables

European Journal of Operational Research, 2015
A minimization problem with a convex separable objective function subject to linear equality constraints and box constraints (bounds on the variables) is considered. Necessary and sufficient optimality condition is proved for a feasible solution to be an
S. Stefanov
semanticscholar   +2 more sources

A hybrid ant colony optimization algorithm for the knapsack problem with a single continuous variable

Proceedings of the Genetic and Evolutionary Computation Conference, 2021
Knapsack problem with a single continuous variable (KPC) is a natural extension of the standard 0-1 knapsack problem. In the KPC, the capacity of the knapsack is not fixed, so it becomes more difficult to solve.
Xinhua Yang, Yufan Zhou, Ailing Shen, Juan Lin, Yiwen Zhong   +4 more
semanticscholar   +2 more sources

A dual approach for the continuous collapsing knapsack problem

Mathematical Programming, 1987
We formulate and solve a dual version of the continuous collapsing knapsack problem using a geometric approach. Optimality conditions are found and an algorithm is presented. Computational experience shows that this procedure is efficient.
Marc E. Posner, Hisatoshi Suzuki
exaly   +2 more sources

Characterization of the optimal solution of the convex separable continuous knapsack problem and related problems

Journal of Information and Optimization Sciences, 2019
A separable convex continuous knapsack problem with a single equality constraint and bounded variables is considered in this paper. Necessary and sufficient condition (characterization) for a feasible solution to be an optimal solution to this problem is
S. Stefanov
semanticscholar   +2 more sources

Solving 0-1 knapsack problem by continuous ACO algorithm

International Journal of Computational Intelligence Studies, 2013
This paper presents a continuous ACO approach to solve 0-1 knapsack problem. In this method, groups of candidate values of the components are constructed, and an amount of pheromone is initialised randomly for each candidate value a real random number between 0.1 and 0.9 in each candidate group.
G S Mahapatra, Rajat Kumar Pal
exaly   +2 more sources

Greedy continuous particle swarm optimisation algorithm for the knapsack problems

International Journal of Computer Applications in Technology, 2012
Knapsack problem is a classical combinatorial optimisation problem. This paper presents greedy continuous particle swarm optimisation (GCPSO) algorithm to solve the knapsack problem. First, the greedy strategy is introduced into the process of particles' initialisation based on standard particle swarm optimisation (SPSO).
Jincai Yang
exaly   +2 more sources

An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable

Journal of Global Optimization, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Geng Lin, Wenxing Zhu, M Montaz Ali
exaly   +3 more sources

A continuous knapsack problem formulation for the robustness analysis of a polytope of polynomials

Proceedings of 1995 American Control Conference - ACC'95, 1995
The problem of checking robust stability of a polytope of polynomials is equivalent to a zero exclusion condition at each frequency. In this paper, we show that this problem can be formulated as two continuous knapsack problems with bounded variables, which are solvable in /spl Oscr/(n) time.
V. Cerone, F. D. Croce
semanticscholar   +2 more sources

Binary team game algorithm based on modulo operation for knapsack problem with a single continuous variable

Applied Soft Computing Journal, 2021
Yichao He
exaly   +2 more sources

Relaxation of the Equality Constrained Convex Continuous Knapsack Problem

Separable Optimization, 2021
S. Stefanov
semanticscholar   +2 more sources