Stochastic set packing problem

DOI10.1016/J.EJOR.2010.11.022zbMATH Open1250.90047OpenAlexW2021687340MaRDI QIDQ713096FDOQ713096

Mercedes Landete, Antonio M. Rodríguez-Chía, Laureano F. 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

zbMATH Keywords

assignmentvolume algorithmset packingLagrangian decompositionsimple recoursestochastic 0-1 programming

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Stochastic programming (90C15) Boolean programming (90C09) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Assignment Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
• Partitioning procedures for solving mixed-variables programming problems
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
• From stochastic dominance to mean-risk models: Semideviations as risk measures
• A stochastic programming approach for supply chain network design under uncertainty
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
• On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Dual decomposition in stochastic integer programming
• Combinatorial auctions: a survey
• Introduction to Stochastic Programming
• On the facial structure of set packing polyhedra
• The Traveling-Salesman Problem and Minimum Spanning Trees
• New formulations for the uncapacitated multiple allocation hub location problem
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Enlarging the region of convergence of Newton's method for constrained optimization
• On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
• Adaptivity and approximation for stochastic packing problems
• Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Stochastic programming with integer variables
• The volume algorithm: Producing primal solutions with a subgradient method
• Lagrangean relaxation. (With comments and rejoinder).
• The million-variable ``march for stochastic combinatorial optimization
• 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
• Conditional value-at-risk in stochastic programs with mixed-integer recourse
• Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
• A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
• On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty
• BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
• On the facets of the simple plant location packing polytope
• Two-stage stochastic hierarchical multiple risk problems: Models and algorithms
• A stochastic integer programming model for incorporating day-ahead trading of electricity into hydro-thermal unit commitment
• Facet Obtaining Procedures for Set Packing Problems
• A heuristic procedure for stochastic integer programs with complete recourse
• Stochastic Covering and Adaptivity
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs
• Beam search heuristic to solve stochastic integer problems under probabilistic constraints
• Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models
• A comparative study of decomposition algorithms for stochastic combinatorial optimization
• Optimizing electricity distribution using two-stage integer recourse models
• The Stochastic Machine Replenishment Problem

Cited In (8)

• 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
• Two‐stage stochastic one‐to‐many driver matching for ridesharing
• A polyhedral study on 0-1 knapsack problems with set packing constraints
• The stochastic generalized bin packing problem
• Cutting and packing problems under uncertainty: literature review and classification framework
• Chance-Constrained Binary Packing Problems

Uses Software

• Knapsack

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)