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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.