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...

Full description

Saved in:

Bibliographic Details
Published in:	Engineering optimization Vol. 54; no. 5; pp. 894 - 906
Main Authors:	Song, Myung Soon, Emerick, Brooks, Lu, Yun, Vasko, Francis J.
Format:	Journal Article
Language:	English
Published:	Taylor & Francis 04.05.2022
Subjects:	classification trees Combinatorial optimization integer programming software machine learning regression models
ISSN:	0305-215X, 1029-0273
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!