Search Results - subject:"branch and bound method"

Learning-accelerated mixed-integer quadratic programming for unit commitment

Maisonneuve, Philippe; Lesage-Landry, Antoine - 2024

Persistent link: https://www.econbiz.de/10014483361

Algorithms for the minimum spanning tree problem with resource allocation

Kataoka, Seiji; Yamada, Takeo - In: Operations Research Perspectives 3 (2016), pp. 5-13

We formulate the minimum spanning tree problem with resource allocation (MSTRA) in two ways, as discrete and continuous optimization problems (d-MSTRA/c-MSTRA), prove these to be NP-hard, and present algorithms to solve these problems to optimality. We reformulate d-MSTRA as the knapsack...

Persistent link: https://www.econbiz.de/10011825928

Algorithms for the minimum spanning tree problem with resource allocation

Kataoka, Seiji; Yamada, Takeo - In: Operations research perspectives 3 (2016), pp. 5-13

Persistent link: https://www.econbiz.de/10011822664

ОПТИМИЗАЦИОННАЯ МОДЕЛЬ И АЛГОРИТМЫ ПОИСКА ОПТИМАЛЬНОГО РЕШЕНИЯ ДЛЯ АНАЛИЗА ЭФФЕКТИВНОСТИ УДАЛЕНИЯ НЕПРИБЫЛЬНЫХ ПРЕДПРИЯТИЙ ИЗ КОМПАНИИ

АРКАДЬЕВНА, ГОРОШНИКОВА ТАТЬЯНА - In: Управление большими … (2012) 3, pp. 173-185

Статья является продолжением работы по разработке практической методики анализа реструктуризации компании с точки зрения максимизации стоимости компании...

Persistent link: https://www.econbiz.de/10011227352

Production Planning for a Winery With Mixed Integer Programming Model

Ertugrul, Irfan; Isik, Aysegul Tus - In: Ege Academic Review 9 (2009) 2, pp. 375-387

a fixed-charge problem and in this paper branch and bound method is used to solve the problem. The results obtained from …

Persistent link: https://www.econbiz.de/10008867540