Skip to content

Latest commit

 

History

History
30 lines (21 loc) · 936 Bytes

README.md

File metadata and controls

30 lines (21 loc) · 936 Bytes

KNP-GP

GRASP implementation for the Knapsack problem.

This repository contains the implementation for both, the GRASP metaheurístic and the optimal approach to solve the Knapsack problem.

The instances used in this work, are adaptations of the instances found in this:

http://artemisa.unicauca.edu.co/~johnyortega/instances_01_KP/

Also for the otimization model, it was considered the formulation found in the follow:

https://personal.utdallas.edu/~scniu/OPRE-6201/documents/DP3-Knapsack.pdf

GRASP Convergence

Comparison