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

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй

Үндсэн зохиолчид:	Diego Yanez-Oyarce, Carlos Contreras-Bolton, Fredy Troncoso-Espinosa, Carlos Rey
Формат:	Artigo
Хэл сонгох:	Inglês
Хэвлэсэн:	IEEE 2025-01-01
Цуврал:	IEEE Access
Нөхцлүүд:	Machine learning combinatorial optimization knapsack problem quadratic multiple knapsack problem
Онлайн хандалт:	https://ieeexplore.ieee.org/document/10839359/
Шошгууд:	Шошго нэмэх Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!