We describe an algorithm for the 0-1 knapsack problem (KP), which relies mainly on three new ideas. The first one is to focus on what we call the core of the problem, namely, a knapsack problem ...

We just care that it’s linear in N. In the Google paper, they discuss two classical algorithms that do match the asymptotic performance — and one of them beats the real-world performance — of the ...

Chih-Ming Liu, Ruey-Li Kao, An-Hsiang Wang, Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing, The Journal of the Operational Research Society, Vol. 45, No. 11 ...