Model-based algorithms for the 0-1 time-bomb knapsack problem

DOI10.1016/J.COR.2025.107010MaRDI QIDQ6974863zbMATH OpenFDO

Authors Roberto Montemanni, Derek H. Smith

Publication date 5 June 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2025.107010

zbMATH Keywords

0-1 knapsackmixed integer linear programmingmodel-based algorithmstime-bomb

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• Exact algorithms for the 0-1 time-bomb knapsack problem
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1114460 (Why is no real title available?)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks
• On the robust knapsack problem
• The Price of Robustness
• The quadratic knapsack problem
• The quadratic knapsack problem with setup
• The static stochastic knapsack problem with normally distributed item sizes
• Where are the hard knapsack problems?

Cited in

(1)

• An exact algorithm for the hazardous orienteering problem

This page was built for publication: Model-based algorithms for the 0-1 time-bomb knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974863)