Knapsack problems—An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …
(2004), knapsack problems became a classical and rich research area in combinatorial …
[BOG][B] Integer programming
LA Wolsey - 2020 - books.google.com
A PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER
VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming …
VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming …
[HTML][HTML] A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem
Abstract The Quadratic Knapsack Problem (QKP) involves selecting a subset of elements
that maximizes the sum of pairwise and singleton utilities without exceeding a given budget …
that maximizes the sum of pairwise and singleton utilities without exceeding a given budget …
Parametric convex quadratic relaxation of the quadratic knapsack problem
We consider a parametric convex quadratic programming (CQP) relaxation for the quadratic
knapsack problem (QKP). This relaxation maintains partial quadratic information from the …
knapsack problem (QKP). This relaxation maintains partial quadratic information from the …
[PDF][PDF] Optimization methods for knapsack and tool switching problems.
A Locatelli - 4OR, 2023 - iris.unimore.it
Knapsack problems are a highly active research area in combinatorial optimization.
Although, the knapsack problem has been known since over a century, see Mathews [368] …
Although, the knapsack problem has been known since over a century, see Mathews [368] …
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
FD Fomeni - Discrete Applied Mathematics, 2023 - Elsevier
Abstract The Quadratic Knapsack Problem (QKP) is a well-known combinatorial optimization
problem which amounts to maximizing a quadratic function of binary variables, subject to a …
problem which amounts to maximizing a quadratic function of binary variables, subject to a …
[PDF][PDF] The importance of fine-tuning Gurobi parameters when solving quadratic knapsack problems: A guide for OR practitioners. Pure and New Mathematics in AI …
D Rando, Y Lu, MS Song, FJ Vasko - optimization, 2024 - researchgate.net
In the operations research (OR) literature several highly efficient solution methods for the
Quadratic Knapsack Problem (QKP) have been documented. However, these solution …
Quadratic Knapsack Problem (QKP) have been documented. However, these solution …
A cooperative learning approach for the quadratic knapsack problem
Abstract The Quadratic Knapsack Problem (QKP) is a well-known optimization problem
aimed to maximize a quadratic objective function subject to linear capacity constraints. It has …
aimed to maximize a quadratic objective function subject to linear capacity constraints. It has …
Metodi di ottimizzazione per problemi di knapsack e tool switching
A Locatelli - 2023 - iris.unimore.it
This Ph. D. thesis deals with two different classes of optimization problems: knapsack
problems and tool switching problems. Knapsack problems became a classical and rich …
problems and tool switching problems. Knapsack problems became a classical and rich …
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
F Djeumou Fomeni - 2023 - dl.acm.org
Abstract The Quadratic Knapsack Problem (QKP) is a well-known combinatorial optimization
problem which amounts to maximizing a quadratic function of binary variables, subject to a …
problem which amounts to maximizing a quadratic function of binary variables, subject to a …