An empirical analysis of exact algorithms for the unbounded knapsack problem.

•An algorithm of 1966 has state-of-the-art performance for current instances.•A concept of solution dominance which generalizes all previous dominances is proposed.•A partial solution dominance competes with the item dominances of the literature.•Cutting stock pricing problems may converge to a strongly correlated distribution.•New and tighter periodicity bounds are not useful for the current algorithms.