A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes

We consider a version of the knapsack problem in which an item size is random and revealed only when the decision maker attempts to insert it. After every successful insertion the decision maker can choose the next item dynamically based on the remaining capacity and available items, while an unsucc...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical programming computation 2021-03, Vol.13 (1), p.185-223
Hauptverfasser:	Blado, Daniel, Toriello, Alejandro
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Decision making Empirical analysis Full Length Paper Insertion Knapsack problem Mathematics Mathematics and Statistics Mathematics of Computing Operations Research/Decision Theory Optimization Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!