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

Full description

Bibliographic Details

Published in:	Computers & operations research Vol. 178; p. 107010
Main Authors:	Montemanni, Roberto, Smith, Derek H.
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.06.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!