| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652108 | Electronic Notes in Discrete Mathematics | 2015 | 8 Pages |
Abstract
In this paper we propose two variants of the variable neighborhood search heuristics to solve the (0 – 1) Quadratic Knapsack Problem. The mixed variable neighborhood descent (Mixed-VND) and the Skewed general variable neighborhood search (SGVNS). The proposed algorithms were tested over a set of large-sized instances with 1000 and 2000 binary variables and the results were compared to those reported from the literature. Encouraging results are obtained.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
