Machine Learning-Driven Optimization for Solution Space Reduction in the Quadratic Multiple Knapsack Problem
The 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. While its solution using metaheuristics has been...
Saved in:
| Main Authors: | Diego Yanez-Oyarce, Carlos Contreras-Bolton, Fredy Troncoso-Espinosa, Carlos Rey |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10839359/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications
by: Tibor Szkaliczki
Published: (2025-03-01) -
ANALYSIS AND IMPLEMENTATION OF A CRYPTOSYSTEM BASED ON NON-INJECTIVE KNAPSACKS
by: Maria Sabina A. Volkov
Published: (2025-07-01) -
Local search-based heuristics for the multiobjective multidimensional knapsack problem
by: Dalessandro Soares Vianna, et al.
Published: (2013-09-01) -
Local search-based heuristics for the multiobjective multidimensional knapsack problem
by: Dalessandro Soares Vianna, et al.
Published: (2012-01-01) -
Adaptation of a Mosquito Swarm Algorithm to Solve a Binary Knapsack Problem
by: Ruqaya Sha’ban, et al.
Published: (2018-12-01)