Improvements in the branch, bound and cut algorithm for the competitive facility location problem - Доклады на конференциях | Sciact - Система учета научной деятельности ИМ СО РАН

Improvements in the branch, bound and cut algorithm for the competitive facility location problem Доклады на конференциях

Язык

Английский

Тип доклада

Секционный

Конференция

Mathematical Optimization Theory and Operations Research 2026
06-11 июл. 2026 , Иркутск

Авторы

Beresnev Vladimir ¹ , Melnikov Andrey ¹

Организации

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

Beresnev V. , Melnikov A.
Improvements in the branch, bound and cut algorithm for the competitive facility location problem
Mathematical Optimization Theory and Operations Research 2026 06-11 Jul 2026