Marthello and Toth lower bound for bin packing and dual feasible functions
Автор: Recherche Opérationnelle
Загружено: 2023-06-30
Просмотров: 477
This video explains the L2 lower bound of Marthello and Toth for Bin-Packing. It connects this lower bound to the more general concept of dual feasible functions which have led to the design of general valid inequalities in Integer Programming.
Themes: Bin-Packing, Integer Programming formulations, dual feasible functions
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке: