Machine Learning-Driven Optimization for Solution Space Reduction in the Quadratic Multiple Knapsack Problem

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...

Full description

Saved in:
Bibliographic Details
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:
Machine learning
combinatorial optimization
knapsack problem
quadratic multiple knapsack problem
Online Access:https://ieeexplore.ieee.org/document/10839359/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://ieeexplore.ieee.org/document/10839359/

Similar Items