Janiak, A; Kovalyov, M Y - In: Journal of the Operational Research Society 63 (2012) 7, pp. 1018-1020
Bachman and Janiak provided a sketch of the proof that the problem 1∣ri(v)=ai is NP-hard in the strong sense. However, they did not show how to avoid using harmonic numbers whose encoding is not pseudo-polynomial, which makes the proof incomplete. In this corrigendum, we provide a new complete...