Evolution of new algorithms for the binary knapsack problem

DOI10.1007/s11047-015-9483-8zbMath1415.68201OpenAlexW2090473206MaRDI QIDQ2003461

Carlos Herrera, Mauricio Sepúlveda, Víctor Parada, Lucas Parada

Publication date: 8 July 2019

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-015-9483-8

zbMATH Keywords

combinatorial optimizationknapsack problemevolutionary computationgenetic programminghyper-heuristicautomatic generation of algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• Hyperheuristics
• GPC++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Molecular solution to the 0-1 knapsack problem based on DNA computing
• Approximate formulations for 0-1 knapsack sets
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• Where are the hard knapsack problems?
• Genetic Algorithms and Genetic Programming
• An Algorithm for Large Zero-One Knapsack Problems
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology

This page was built for publication: Evolution of new algorithms for the binary knapsack problem