LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the Gap
暂无分享,去创建一个
[1] John L. Bruno,et al. Probabilistic bounds for dual bin-packing , 1985, Acta Informatica.
[2] John Martinovic,et al. Integer rounding and modified integer rounding for the skiving stock problem , 2016, Discret. Optim..
[3] E. J. Zak. The skiving stock problem as a counterpart of the cutting stock problem , 2003 .
[4] Pratik J. Parikh,et al. A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital , 2013, Eur. J. Oper. Res..
[5] Gilbert Laporte,et al. An exact algorithm for the dual bin packing problem , 1995, Oper. Res. Lett..
[6] J. B. G. Frenk,et al. Probabilistic Analysis of Algorithms for Dual Bin Packing Problems , 1991, J. Algorithms.
[7] Fred W. Glover,et al. A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem , 2004, J. Heuristics.
[8] M. P. Johnson,et al. Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry , 1997, SIAM Rev..
[9] Joseph Y.-T. Leung,et al. On a Dual Version of the One-Dimensional Bin Packing Problem , 1984, J. Algorithms.
[10] John Martinovic,et al. Integer linear programming models for the skiving stock problem , 2016, Eur. J. Oper. Res..
[11] Zeger Degraeve,et al. Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem , 2006, Eur. J. Oper. Res..