Discovering and certifying lower bounds for the online bin stretching problem

Martin Böhm 0001, Bertrand Simon. Discovering and certifying lower bounds for the online bin stretching problem. Theoretical Computer Science, 938:1-15, 2022. [doi]

Authors

Martin Böhm 0001

This author has not been identified. Look up 'Martin Böhm 0001' in Google

Bertrand Simon

This author has not been identified. Look up 'Bertrand Simon' in Google