Solving robust bin-packing problems with a branch-and-price approach

Xavier Schepler, André Rossi, Evgeny Gurevsky, Alexandre Dolgui

Abstract: Highlights•New robust models are studied for bin packing with items of uncertain sizes.•Stability radius and relative resiliency measures are employed.•A branch-and-price algorithm is developed to efficiently solve the models.•Protections against uncertainty and costs for robustness are evaluated numerically.•Managerial insights are given.