Analysis of Divide-and-Conquer strategies for the 0–1 minimization knapsack problem

Probability and Measure.

PE, P. Billingsley · Journal of the American Statistical Association · 1996 · 6.7K citations

Measure Theory, Random Variables, Engineering +14

Knapsack Problems: Algorithms and Computer Implementations

David Connolly, Silvano Martello, Paolo Toth · Journal of the Operational Research Society · 1991 · 3.2K citations

Metaheuristics in combinatorial optimization

Christian Blum, Andrea Roli · ACM Computing Surveys · 2003 · 3.1K citations

Metaheuristics in Combinatorial Optimization

Michel Gendreau, Jean‐Yves Potvin · Annals of Operations Research · 2005 · 2.3K citations

Mathematical Programming, Engineering, Combinatorial Problem +5

Hybrid metaheuristics in combinatorial optimization: A survey

Christian Blum, Jakob Puchinger, Günther R. Raidl et al. · Applied Soft Computing · 2011 · 738 citations · Full text

Hybrid Algorithm, Engineering, Intelligent Optimization +4