Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem

CARLOS GARCÍA MARTÍNEZ2026-01-292026-01-29201410.1016/j.ejor.2013.07.0352-s2.0-84884586347https://www.scopus.com/inward/record.uri?eid=2-s2.https://ucocris.uco.es/handle/123456789/24829Computer Science (all)Information Systems and ManagementManagement Science and Operations ResearchModeling and SimulationTabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problemresearch article