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

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!