A recent paper by Heinz and Beck CPAIOR found that mixed integer software has become competitive with or superior to logic-based Benders decomposition for the solution of facility assignment and scheduling problems. Their implementation of Benders differs, however, from that described in the literature they cite and therefore results in much slower performance than previously reported. We find that when correctly implemented, the Benders method remains 2 to 3 orders of magnitude faster than the latest commercial mixed integer software on larger instances, thus reversing the conclusion of the earlier paper.
Unable to display preview. Download preview PDF. Skip to main content. Advertisement Hide. Mixed Integer Programming vs. Conference paper. This process is experimental and the keywords may be updated as the learning algorithm improves. This is a preview of subscription content, log in to check access. Aron, I. LNCS, vol. Beck, J.
Benders, J. Benini, L. In: van Beek, P. CP Cambazard, H. In: Wallace, M. Chu, Y. Coban, E. In: Lodi, A. Harjunkoski, I. Heinz, S. In: Beldiceanu, N.
Hooker, J. Springer Google Scholar. In: Saraswat, V. Jain, V. Maravelias, C. Terekhov, D. Thorsteinsson, E. In: Walsh, T. Timpe, C. Yunes, T. Hooker 1 1. Personalised recommendations. Cite paper How to cite? ENW EndNote. Buy options.
