Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints
From MaRDI portal
Publication:2806828
Recommendations
- Robust optimization approach for a chance-constrained binary knapsack problem
- Knapsack problem with probability constraints
- The multidimensional 0-1 knapsack problem: an overview.
- Probabilistic Analysis of the Multidimensional Knapsack Problem
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
Cites work
- scientific article; zbMATH DE number 1971713 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- A PTAS for the chance-constrained knapsack problem with random item sizes
- A Stochastic Programming Model
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A survey of effective heuristics and their application to a variety of knapsack problems
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Association of Random Variables, with Applications
- Computationally manageable combinational auctions
- Constraints in container loading -- a state-of-the-art review
- Convexity of chance constraints with independent random variables
- Distributionally robust joint chance constraints with second-order moment information
- Easy distributions for combinatorial optimization problems with probabilistic constraints
- On Multivariate Discrete Moment Problems and Their Applications to Bounding Expectations and Probabilities
- Review of nonlinear mixed-integer and disjunctive programming techniques
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Stochastic binary problems with simple penalties for capacity constraints violations
- The Theory and Computation of Knapsack Functions
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- The multidimensional 0-1 knapsack problem: an overview.
- The pricing of options and corporate liabilities
- The use of discrete moment bounds in probabilistic constrained stochastic programming models
Cited in
(3)- scientific article; zbMATH DE number 4061000 (Why is no real title available?)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Cutting and packing problems under uncertainty: literature review and classification framework
This page was built for publication: Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806828)
