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

DOI10.1016/J.COR.2022.105848MaRDI QIDQ2147139zbMATH OpenOpenAlexFDO

Authors Michele Monaci, Ciara Pike-Burke, Alberto Santini

Publication date 22 June 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

computational experimentsexact algorithmsknapsack problemstochastic optimisation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
• Exact solution of the robust knapsack problem
• Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
• A new exact approach for the 0-1 collapsing knapsack problem
• A stochastic linear knapsack problem

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1114460 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A PTAS for the chance-constrained knapsack problem with random item sizes
• A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
• A robust approach to the chance-constrained knapsack problem
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
• Algorithms for randomized time-varying knapsack problems
• An Algorithm for Large Zero-One Knapsack Problems
• An exact algorithm for the fixed-charge multiple knapsack problem
• Applications of second-order cone programming
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• Chance-Constrained Binary Packing Problems
• Discrete-variable extremum problems
• Distributionally robust stochastic knapsack problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Exact algorithms and evolutionary algorithms for randomized time-varying knapsack problem
• Improved approximation results for stochastic knapsack problems
• Monotonicity properties for the stochastic knapsack
• On the robust knapsack problem
• On two-stage stochastic knapsack problems
• Some applications of the theory of dynamic programming -- a review
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• The Price of Robustness
• The dynamic and stochastic knapsack problem
• The static stochastic knapsack problem with normally distributed item sizes
• The stochastic knapsack problem
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
• Where are the hard knapsack problems?

Cited in

(4)

• The hazardous orienteering problem
• Approximating single- and multi-objective nonlinear sum and product knapsack problems
• Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem
• Exact algorithms and evolutionary algorithms for randomized time-varying knapsack problem

Describes a project that uses

Uses Software

• GitHub
• Knapsack

This page was built for publication: Exact 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 Q2147139)