Results 11 to 20 of about 5,749 (206)
A cut-and-branch algorithm for the Quadratic Knapsack Problem [PDF]
Discrete Optimization, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Djeumou Fomeni, Franklin +2 more
openaire +2 more sources
IEEE AccessThe quadratic multiple knapsack problem (QMKP) is a well-studied problem in operations research. This problem involves selecting a subset of items that maximizes the linear and quadratic profit without exceeding a set of capacities for each knapsack ...
Diego Yanez-Oyarce +3 more
doaj +2 more sources
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem [PDF]
Discrete Applied Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Galli L., Martello S., Rey C., Toth P.
openaire +5 more sources
Toward Practical Benchmarks of Ising Machines: A Case Study on the Quadratic Knapsack Problem
IEEE AccessCombinatorial optimization has wide applications from industry to natural science. Ising machines bring an emerging computing paradigm for efficiently solving a combinatorial optimization problem by searching a ground state of a given Ising model ...
Kentaro Ohno +2 more
doaj +2 more sources
QMKPy: A Python Testbed for the Quadratic Multiple Knapsack Problem [PDF]
Journal of Open Source Software, 2022 QMKPy provides a Python framework for modeling and solving the quadratic multiple knapsack problem (QMKP). It is primarily aimed at researchers who develop new solution algorithms for the QMKP. QMKPy therefore mostly functions as a testbed to quickly implement novel algorithms and compare their results with existing ones.
Karl-Ludwig Besser, Eduard A. Jorswieck
openaire +3 more sources
An iterated “hyperplane exploration” approach for the quadratic knapsack problem [PDF]
Computers & Operations Research, 2017 The quadratic knapsack problem (QKP) is a well-known combinatorial optimization problem with numerous applications. Given its NP-hard nature, finding optimal solutions or even high quality suboptimal solutions to QKP in the general case is a highly challenging task. In this paper, we propose an iterated “hyperplane exploration” approach (IHEA) to solve
Chen, Yuning, Hao, Jin-Kao
openaire +4 more sources
Exact Solution Methods for the $k$-item Quadratic Knapsack Problem [PDF]
, 2016 The purpose of this paper is to solve the 0-1 $k$-item quadratic knapsack problem $(kQKP)$, a problem of maximizing a quadratic function subject to two linear constraints. We propose an exact method based on semidefinite optimization.
A Billionnet +18 more
core +3 more sources
Computers & Operations Research, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cacchiani V. +3 more
openaire +5 more sources
A Hybrid Machine Learning–Metaheuristic Approach to Solving the Quadratic Multidimensional Knapsack Problem [PDF]
MathematicsThe quadratic multidimensional knapsack problem (QMdKP) is a combinatorial optimization problem that involves selecting a subset of items to maximize both linear and quadratic profits without exceeding the capacity constraints across multiple dimensions.
Jorge Tapia-Oñate, Carlos Rey
doaj +2 more sources
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem [PDF]
Mathematical Methods of Operations Research, 2020 AbstractIn this article, we introduce the rectangular knapsack problem as a special case of the quadratic knapsack problem consisting in the maximization of the product of two separate knapsack profits subject to a cardinality constraint. We propose a polynomial time algorithm for this problem that provides a constant approximation ratio of 4.5.
Britta Schulze +5 more
openaire +2 more sources