An Iterated Semi-Greedy Algorithm for the 0-1 Quadratic Knapsack Problem

EasyChair Preprint no. 437

Abstract

This paper presents a new Iterated Semi-Greedy Algorithm (ISGA) for the 0-1 Quadratic Knapsack Problem.The proposed ISGA is easier to implement, runs faster, and produces comparable results than state-of-the-art methods. Computational evaluation is performed over a benchmark with large instances of 1000 and 2000 objects.

Keyphrases: 0-1 Quadratic Knapsack Problem, greedy algorithms, Metaheuristics, semi-greedy

@Booklet{EasyChair:437,
  author = {Leticia Leonor Pinto Alva and Alexander J. Benavides},
  title = {An Iterated Semi-Greedy Algorithm for the 0-1 Quadratic Knapsack Problem},
  howpublished = {EasyChair Preprint no. 437},
  doi = {10.29007/fx82},
  year = {EasyChair, 2018}}