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

Celý popis

Podrobná bibliografia

Vydané v:	Computers & operations research Ročník 178; s. 107010
Hlavní autori:	Montemanni, Roberto, Smith, Derek H.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.06.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!