Exact algorithms for the 0-1 time-bomb knapsack problem

DOI10.1016/j.cor.2022.105848OpenAlexW4280565811MaRDI QIDQ2147139

Alberto Santini, Ciara Pike-Burke, Michele Monaci

Publication date: 22 June 2022

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

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105848

zbMATH Keywords

computational experimentsknapsack problemstochastic optimisationexact algorithms

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ The hazardous orienteering problem

Uses Software

• Knapsack
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two-stage stochastic knapsack problems
• The static stochastic knapsack problem with normally distributed item sizes
• A robust approach to the chance-constrained knapsack problem
• A PTAS for the chance-constrained knapsack problem with random item sizes
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
• An exact algorithm for the fixed-charge multiple knapsack problem
• Applications of second-order cone programming
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
• Where are the hard knapsack problems?
• The Dynamic and Stochastic Knapsack Problem
• Distributionally Robust Stochastic Knapsack Problem
• Chance-Constrained Binary Packing Problems
• A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• The Price of Robustness
• The stochastic knapsack problem
• An Algorithm for Large Zero-One Knapsack Problems
• Monotonicity properties for the stochastic knapsack
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• Some Applications of the Theory of Dynamic Programming—A Review
• Discrete-Variable Extremum Problems
• On the Robust Knapsack Problem
• Algorithms for randomized time-varying knapsack problems

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