Stochastic set packing problem
From MaRDI portal
Publication:713096
Recommendations
Cites work
- scientific article; zbMATH DE number 1688599 (Why is no real title available?)
- scientific article; zbMATH DE number 1688600 (Why is no real title available?)
- scientific article; zbMATH DE number 1984254 (Why is no real title available?)
- A comparative study of decomposition algorithms for stochastic combinatorial optimization
- A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
- A heuristic procedure for stochastic integer programs with complete recourse
- A stochastic integer programming model for incorporating day-ahead trading of electricity into hydro-thermal unit commitment
- A stochastic programming approach for supply chain network design under uncertainty
- A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
- Adaptivity and approximation for stochastic packing problems
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Assignment Problems
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- Combinatorial auctions: a survey
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Dual decomposition in stochastic integer programming
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs
- Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
- Enlarging the region of convergence of Newton's method for constrained optimization
- Facet Obtaining Procedures for Set Packing Problems
- From stochastic dominance to mean-risk models: Semideviations as risk measures
- Introduction to Stochastic Programming
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Lagrangean relaxation. (With comments and rejoinder).
- Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- New formulations for the uncapacitated multiple allocation hub location problem
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
- On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- On the facets of the simple plant location packing polytope
- On the facial structure of set packing polyhedra
- Optimizing electricity distribution using two-stage integer recourse models
- Partitioning procedures for solving mixed-variables programming problems
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Stochastic Covering and Adaptivity
- Stochastic programming with integer variables
- The Stochastic Machine Replenishment Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The million-variable ``march for stochastic combinatorial optimization
- The volume algorithm: Producing primal solutions with a subgradient method
- Two-stage stochastic hierarchical multiple risk problems: Models and algorithms
Cited in
(10)- A polyhedral study on 0-1 knapsack problems with set packing constraints
- On solving strong multistage nonsymmetric stochastic mixed 0-1 problems
- Average case analysis of the set packing problem
- Two‐stage stochastic one‐to‐many driver matching for ridesharing
- The stochastic generalized bin packing problem
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- Cutting and packing problems under uncertainty: literature review and classification framework
- Chance-Constrained Binary Packing Problems
- Product packing and stacking under uncertainty: a robust approach
- scientific article; zbMATH DE number 3943557 (Why is no real title available?)
This page was built for publication: Stochastic set packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713096)
