Stochastic set packing problem
From MaRDI portal
Publication:713096
DOI10.1016/j.ejor.2010.11.022zbMath1250.90047MaRDI QIDQ713096
Mercedes Landete, Antonio M. Rodríguez-Chía, Laureano Fernando Escudero Bueno
Publication date: 26 October 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.11.022
Lagrangian decomposition; set packing; assignment; volume algorithm; simple recourse; stochastic 0-1 programming
90C15: Stochastic programming
90C27: Combinatorial optimization
90B80: Discrete location and assignment
90C09: Boolean programming
Related Items
On solving strong multistage nonsymmetric stochastic mixed 0-1 problems, Product packing and stacking under uncertainty: a robust approach, An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees, A polyhedral study on 0-1 knapsack problems with set packing constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- New formulations for the uncapacitated multiple allocation hub location problem
- A heuristic procedure for stochastic integer programs with complete recourse
- On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
- A comparative study of decomposition algorithms for stochastic combinatorial optimization
- A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Partitioning procedures for solving mixed-variables programming problems
- Enlarging the region of convergence of Newton's method for constrained optimization
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Dual decomposition in stochastic integer programming
- Stochastic programming with integer variables
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- The volume algorithm: Producing primal solutions with a subgradient method
- From stochastic dominance to mean-risk models: Semideviations as risk measures
- On the facets of the simple plant location packing polytope
- Lagrangean relaxation. (With comments and rejoinder).
- Two-stage stochastic hierarchical multiple risk problems: Models and algorithms
- A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- A stochastic programming approach for supply chain network design under uncertainty
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- The million-variable ``march for stochastic combinatorial optimization
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- A stochastic integer programming model for incorporating day-ahead trading of electricity into hydro-thermal unit commitment
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- Combinatorial Auctions: A Survey
- 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
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- The Stochastic Machine Replenishment Problem
- Stochastic Covering and Adaptivity
- Assignment Problems
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Introduction to Stochastic Programming
- Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
- Facet Obtaining Procedures for Set Packing Problems
- Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
- On the facial structure of set packing polyhedra
- The Traveling-Salesman Problem and Minimum Spanning Trees
