Mixed-integer linear programming approximations for the stochastic knapsack

DOI10.1016/J.COR.2026.107571MaRDI QIDQ7348434zbMATH OpenFDO

Authors Roberto Rossi, Steven Prestwich, S. Armagan Tarim

Publication date 15 September 2026

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

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

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• A new class of hard problem instances for the 0-1 knapsack problem
• A PTAS for the chance-constrained knapsack problem with random item sizes
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
• A single-resource allocation problem with Poisson resource requirements
• An adaptive stochastic knapsack problem
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Core problems in knapsack algorithms
• Discrete-variable extremum problems
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Fundamentals of supply chain theory
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• 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 3196612 (Why is no real title available?)
• Introduction to stochastic programming.
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• Optimal approximation of convex curves by functions which are piecewise linear
• Piecewise linear lower and upper bounds for the standard normal first order loss function
• Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
• Static stochastic Knapsack problems
• Stochastic binary problems with simple penalties for capacity constraints violations
• Stochastic knapsack revisited: the service level perspective
• The dynamic and stochastic knapsack problem
• The Risk-Averse Static Stochastic Knapsack Problem
• The sample average approximation method for stochastic discrete optimization
• 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?

This page was built for publication: Mixed-integer linear programming approximations for the stochastic knapsack

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