A note on 'Exact and approximate methods for a one-dimensional minimax bin-packing problem' [Annals of Operations Research (2013) 206: 611-626]


In a recent paper, Brusco, Khn and Steinley [Ann. Oper. Res. 206:611-626 (2013)] conjecture that the 2 bins special case of the one-dimensional minimax bin-packing problem with bin size constraintsmight be solvable in polynomial time. In this note, we show that this problem is NP-hard for the special caseand thatit is strongly NP-hard for the general… (More)


  • Presentations referencing similar topics