Results 171 to 180 of about 5,749 (206)
Some of the next articles are maybe not open access.
Quadratic bottleneck knapsack problems
Journal of Heuristics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruonan Zhang, Abraham P. Punnen
openaire +1 more source
Fast Algorithm for the Quadratic Knapsack Problem
Vestnik St. Petersburg University, Mathematics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Lagrangian heuristics for the Quadratic Knapsack Problem
Computational Optimization and Applications, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jesus Ossian Cunha +2 more
openaire +2 more sources
A Mini-Swarm for the Quadratic Knapsack Problem
2007 IEEE Swarm Intelligence Symposium, 2007The 0-1 quadratic knapsack problem (QKP) is a hard computational problem, which is a generalization of the knapsack problem (KP). In this paper, a mini-swarm system is presented. Each agent, realized with minor declarative knowledge and simple behavioral rules, searches on a structural landscape of the problem through the guided generate-and-test ...
Xiao-Feng Xie 0001, Jiming Liu 0001
openaire +1 more source
A reactive search for the quadratic knapsack problem
2017 4th International Conference on Control, Decision and Information Technologies (CoDIT), 2017In this paper, we propose an reactive method to solve the Quadratic Knapsack Problem (noted QKP). The quadratic knapsack problem is a well-studied combinatorial optimisation problem. In all variants of the quadratic knapsack problems, for a set of given items, profits are not only assigned to individual items but also to pairs of them.
Najat Al-Iedani +2 more
openaire +1 more source
A Newton’s method for the continuous quadratic knapsack problem
Mathematical Programming Computation, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roberto Cominetti +2 more
openaire +2 more sources
1980
The quadratic knapsack (QK) model naturally arises in a variety of problems in operations research, statistics and combinatorics. Some “upper planes” for the QK problem are derived, and their different uses in a branch-and-bound scheme for solving such a problem are discussed.
Gallo, G., Hammer, P. L., Simeone, B.
openaire +1 more source
The quadratic knapsack (QK) model naturally arises in a variety of problems in operations research, statistics and combinatorics. Some “upper planes” for the QK problem are derived, and their different uses in a branch-and-bound scheme for solving such a problem are discussed.
Gallo, G., Hammer, P. L., Simeone, B.
openaire +1 more source
A Semidefinite Programming Approach to the Quadratic Knapsack Problem
Journal of Combinatorial Optimization, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christoph Helmberg +2 more
openaire +1 more source
The Quadratic Knapsack Problem
2004In all the variants of the knapsack problems considered so far the profit of choosing a given item was independent of the other items chosen. In many real life applications as well as in problems with roots in graph theory it is natural to assume that the profit of a packing also should reflect how well the given items fit together.
Hans Kellerer +2 more
openaire +1 more source
On reduction of duality gap in quadratic knapsack problems
Journal of Global Optimization, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaojin Zheng +3 more
openaire +1 more source