BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20221021T120000Z
UID:0793af7546173bdb9beff941f2d61158-346
DTSTAMP:19700101T120015Z
DESCRIPTION:Improved Algorithms for Variants of Bin Packing and Knapsack.
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/346/improved-algorithms-for-variants-of-bin-packing-and-knapsack/
SUMMARY:We study variants of two classical optimization problems: Bin Packing and Knapsack. Both bin packing and knapsack fall under the regime of
DTSTART:20221021T120000Z
END:VEVENT
END:VCALENDAR