Results 1 to 10 of about 5,749 (206)
Approximation of the Quadratic Knapsack Problem [PDF]
INFORMS Journal on Computing, 2016 We study the approximability of the classical quadratic knapsack problem (QKP) on special graph classes. In this case the quadratic terms of the objective function are not given for each pair of knapsack items. Instead, an edge weighted graph, whose vertices represent the knapsack items, induces a quadratic profit for every pair of items, which is ...
Ulrich Pferschy, Joachim Schauer
exaly +10 more sources
The quadratic knapsack problem with setup
Computers and Operations ResearchzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Laura Galli +2 more
exaly +5 more sources
Memetic Search for the Generalized Quadratic Multiple Knapsack Problem [PDF]
IEEE Transactions on Evolutionary Computation, 2016 The generalized quadratic multiple knapsack problem (GQMKP) extends the classical quadratic multiple knapsack problem with setups and knapsack preference of the items.
Yuning Chen, Jin-Kao Hao
exaly +8 more sources
A two-phase method for solving continuous rank-one quadratic knapsack problems [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2022 We propose a two-phase algorithm for solving continuous rank-one quadratic knapsack problems (R1QKPs). In particular, we study the solution structure of the problem without the knapsack constraint.
S.E. Monabbati
doaj +2 more sources
On good encodings for quantum annealer and digital optimization solvers [PDF]
Scientific Reports, 2023 Several optimization solvers inspired by quantum annealing have been recently developed, either running on actual quantum hardware or simulating it on traditional digital computers.
Alberto Ceselli, Marco Premoli
doaj +2 more sources
The quadratic knapsack problem—a survey
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Pisinger
exaly +3 more sources
The quadratic knapsack problem
European Journal of Operational ResearchzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Laura Galli +2 more
exaly +4 more sources
Parametric convex quadratic relaxation of the quadratic knapsack problem
European Journal of Operational Research, 2020 We consider a parametric convex quadratic programming, CQP, relaxation for the quadratic knapsack problem, QKP. This relaxation maintains partial quadratic information from the original QKP by perturbing the objective function to obtain a concave quadratic term. The nonconcave part generated by the perturbation is then linearized by a standard approach
Marcia Fampa, Fei Wang
exaly +3 more sources
A Deep Reinforcement Learning-Based Scheme for Solving Multiple Knapsack Problems
Applied Sciences, 2022 A knapsack problem is to select a set of items that maximizes the total profit of selected items while keeping the total weight of the selected items no less than the capacity of the knapsack.
Giwon Sur +3 more
doaj +1 more source
Greedy permanent magnet optimization
Nuclear Fusion, 2023 A number of scientific fields rely on placing permanent magnets in order to produce a desired magnetic field. We have shown in recent work that the placement process can be formulated as sparse regression.
Alan A. Kaptanoglu +2 more
doaj +1 more source