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
-
An efficient binary spider wasp optimizer for multi-dimensional knapsack instances: experimental validation and analysis
by: Mohamed Abdel-Basset, et al.
Published: (2025-01-01) -
Exact makespan minimization of unrelated parallel machines
by: Åblad, Edvin, et al.
Published: (2021-05-01) -
Estimating self-performance when making complex decisions
by: Xiaping Lu, et al.
Published: (2025-01-01) -
Optimality and stability of symmetric evolutionary games with applications in genetic selection
by: Yuanyuan Huang, et al.
Published: (2014-12-01) -
Hyper-Heuristics and Scheduling Problems: Strategies, Application Areas, and Performance Metrics
by: Alonso Vela, et al.
Published: (2025-01-01)