Title: Competitive Algorithms for Online Joint Replenishment and Friends

Speaker: William Umboh

Summary:
The Joint Replenishment Problem (JRP) is a fundamental problem originating from operations research with applications in logistics and inventory management. In this talk, we will survey recent work from theoretical computer science on competitive algorithms for generalisations of JRP in the online setting. No previous knowledge of JRP or online algorithms is needed for this talk.”

Biography:
Dr William Umboh is a Lecturer in Computational Theory at the School of Computing and Information Systems at The University of Melbourne. He applies a theoretical computer science approach to discrete optimisation problems. In particular, his primary focus is on designing approximation and online algorithms for network design and joint replenishment problems. Recently, he is also interested in developing principled approaches to using machine-learned predictions to augment approximation and online algorithms.

Previously, he was a Lecturer in Algorithms at the University of Sydney, and a postdoc at the Eindhoven University of Technology with Prof. Nikhil Bansal. Before that, he obtained his PhD in Computer Science from the University of Wisconsin-Madison where he was advised by Profs. Shuchi Chawla and Eric Bach.

MEETING ID: 873 1557 5255; PASSWORD: 778635

WED 20 SEPTEMBER 16:00-17:00 (AEST, Melbourne Time) – Hybrid event:

Room: !290-8-8109-Meeting Room (Workshop)
Level 8 Melbourne Connect