Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem

A stochastic version of the 0–1 Knapsack Problem recently introduced in the literature and named the 0–1 Time-Bomb Knapsack Problem is the topic of the present work. In this problem, in addition to profit and weight, each item is characterized by a probability of exploding, and therefore destroying...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research Jg. 178; S. 107010
Hauptverfasser:	Montemanni, Roberto, Smith, Derek H.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.06.2025
Schlagworte:	0-1 Knapsack Mixed integer linear programming Model-based algorithms Time-bomb Time-bomb Mixed integer linear programming Model-based algorithms 0-1 Knapsack
ISSN:	0305-0548
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A stochastic version of the 0–1 Knapsack Problem recently introduced in the literature and named the 0–1 Time-Bomb Knapsack Problem is the topic of the present work. In this problem, in addition to profit and weight, each item is characterized by a probability of exploding, and therefore destroying all the contents of the knapsack, in case it is loaded. The optimization aims at maximizing the expected profit of the selected items, which takes into account also the probabilities of explosion, while fulfilling the capacity constraint. The problem has real-world applications in logistics and cloud computing. In this work, two model-based algorithms are introduced. They are based on partial linearizations of a non-linear model describing the problem. Extensive computational results on the instances available in the literature are presented to position the new methods as the best-performing ones, while comparing against those previously proposed.
ISSN:	0305-0548
DOI:	10.1016/j.cor.2025.107010