Kalczynski, Pawel J.; Kamburowski, Jerzy - In: European Journal of Operational Research 198 (2009) 1, pp. 93-101
If a certain optimization problem is NP-hard or even harder, one could expect that the chances of solving it optimally should rather decrease with an increase of the problem size. We reveal, however, that the opposite occurs for a strongly NP-hard problem, which requires sequencing n jobs...