When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners

An important generalization of the classic 0-1 knapsack problem is the multi-demand multidimensional knapsack problem (MDMKP). In addition to being theoretically difficult to solve (it is NP-hard), it can be in practice difficult to solve because of its conflicting knapsack and demand constraints. S...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Engineering optimization Jg. 54; H. 5; S. 894 - 906
Hauptverfasser:	Song, Myung Soon, Emerick, Brooks, Lu, Yun, Vasko, Francis J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Taylor & Francis 04.05.2022
Schlagworte:	classification trees Combinatorial optimization integer programming software machine learning regression models
ISSN:	0305-215X, 1029-0273
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!