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

DOI10.1016/J.COR.2022.105848OpenAlexW4280565811MaRDI QIDQ2147139FDOQ2147139

Authors: Michele Monaci, Ciara Pike-Burke, Alberto Santini 

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

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

zbMATH Keywords

computational experimentsexact algorithmsknapsack problemstochastic optimisation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Title not available (Why is that?)
• The Price of Robustness
• Title not available (Why is that?)
• Applications of second-order cone programming
• Where are the hard knapsack problems?
• Distributionally robust stochastic knapsack problem
• The dynamic and stochastic knapsack problem
• An Algorithm for Large Zero-One Knapsack Problems
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• Improved approximation results for stochastic knapsack problems
• A PTAS for the chance-constrained knapsack problem with random item sizes
• Chance-Constrained Binary Packing Problems
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• On the robust knapsack problem
• The static stochastic knapsack problem with normally distributed item sizes
• A robust approach to the chance-constrained knapsack problem
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
• The stochastic knapsack problem
• On two-stage stochastic knapsack problems
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Discrete-variable extremum problems
• A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
• Title not available (Why is that?)
• Monotonicity properties for the stochastic knapsack
• Some applications of the theory of dynamic programming -- a review
• An exact algorithm for the fixed-charge multiple 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
• Exact algorithms and evolutionary algorithms for randomized time-varying knapsack problem

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

Uses Software

• Knapsack
• GitHub

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)