The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem

DOI10.1016/S0377-2217(96)00308-6zbMath0929.90075MaRDI QIDQ1280190

Geun Tae Oh, Tae-Eog Lee

Publication date: 3 February 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

growth modelsstochastic knapsack problemmulti-class stochastic knapsack problemmultiple classes of random items

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items

An adaptive stochastic knapsack problem

Uses Software

• Algorithm 632

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• A probabilistic analysis of the multiknapsack value function
• The growth of m-constraint random knapsacks
• On rates of convergence and asymptotic normality in the multiknapsack problem
• Random knapsacks with many constraints
• The growth of multi-constraint random knapsack with various right-hand sides of the constraints
• Weighted sums of certain dependent random variables
• Algorithm 632: A program for the 0–1 multiple knapsack problem
• The stochastic knapsack problem
• Martingale Inequalities, Interpolation and NP-Complete Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Monotonicity properties for the stochastic knapsack
• Some Results on the Complete and Almost Sure Convergence of Linear Combinations of Independent Random Variables and Martingale Differences
• Convex Analysis
• Martingale Inequalities and NP-Complete Problems