Knapsack problem with probability constraints
From MaRDI portal
Publication:628737
DOI10.1007/s10898-010-9566-0zbMath1213.90213OpenAlexW2135543946MaRDI QIDQ628737
Abdel Lisser, Alexei A. Gaivoronski, Hu Xu, Rafael Beltran Lopez
Publication date: 14 March 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9566-0
Related Items (11)
Stochastic Quadratic Knapsack with Recourse ⋮ On a stochastic bilevel programming problem ⋮ Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks ⋮ Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem ⋮ Stochastic nuclear outages semidefinite relaxations ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ Product assortment and space allocation strategies to attract loyal and non-loyal customers ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ Approximability of the two-stage stochastic knapsack problem with discretely distributed weights ⋮ Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks ⋮ The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
Cites Work
- Unnamed Item
- Bounds for the quadratic assignment problem using the bundle method
- The quadratic knapsack problem -- a survey
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Geometric algorithms and combinatorial optimization
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A semidefinite programming approach to the quadratic knapsack problem
- The Dynamic and Stochastic Knapsack Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
This page was built for publication: Knapsack problem with probability constraints
