When Irreducible Bin Packing Leads to Efficient Scheduling in the Routing Open Shop - Доклады на конференциях | Sciact - Система учета научной деятельности ИМ СО РАН

When Irreducible Bin Packing Leads to Efficient Scheduling in the Routing Open Shop Доклады на конференциях

Язык

Английский

Тип доклада

Секционный

Url доклада

https://toc.yonsei.ac.kr/aaac2019/

Конференция

The 12th Annual Meeting of the Asian Association for Algorithms and Computation
19-21 апр. 2019 , Seoul

Авторы

Chernykh Ilya ¹ , Pyatkin Artem ¹

Организации

1	Институт математики им. С.Л. Соболева СО РАН

Chernykh I. , Pyatkin A.
When Irreducible Bin Packing Leads to Efficient Scheduling in the Routing Open Shop
The 12th Annual Meeting of the Asian Association for Algorithms and Computation 19-21 Apr 2019