Xu, Liang; Xu, Zhou; Xu, Dongsheng - In: European Journal of Operational Research 227 (2013) 2, pp. 284-292
minimized. The problem is known to be NP-hard even when k=2. In this paper, we have developed a pseudo-polynomial time exact … algorithm for this problem with any constant k⩾2, closing a question that has remained open for a decade. Along with this, we …