作者: Bianca de Almeida Dantas , Edson Norberto Cáceres
DOI: 10.1016/J.PROCS.2015.05.411
关键词:
摘要: Abstract The knapsack problem is a widely known in combinatorial optimization and has been object of many researches the last decades. great number variants obtaining an exact solution to any these not easily accomplished, which motivates search for alternative techniques solve problem. Among alternatives, metaheuristics seem be suitable on approximate solutions In this work we propose sequential parallel implementation multidimensional using GRASP metaheuristic. obtained results show that can lead good quality results, even optimal some instances, CUDA may used expand neighborhood as result improved results.