Stochastic set packing problem (Q713096)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Stochastic set packing problem

scientific article; zbMATH DE number 6099094

Language	Label	Description	Also known as
default for all languages	No label defined
English	Stochastic set packing problem	scientific article; zbMATH DE number 6099094

Statements

instance of

scholarly article

0 references

title

Stochastic set packing problem (English)

0 references

author

Mercedes Landete

0 references

Antonio M. Rodríguez-Chía

0 references

Laureano F. Escudero Bueno

0 references

published in

European Journal of Operational Research

0 references

publication date

26 October 2012

0 references

zbMATH Keywords

assignment

0 references

set packing

0 references

stochastic 0-1 programming

0 references

simple recourse

0 references

Lagrangian decomposition

0 references

volume algorithm

0 references

describes a project that uses

Knapsack

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2010.11.022

0 references

cites work

BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.

0 references

Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models

0 references

The volume algorithm: Producing primal solutions with a subgradient method

0 references

Partitioning procedures for solving mixed-variables programming problems

0 references

Beam search heuristic to solve stochastic integer problems under probabilistic constraints

0 references

Enlarging the region of convergence of Newton's method for constrained optimization

0 references

Introduction to Stochastic Programming

0 references

Assignment Problems

0 references

On the facets of the simple plant location packing polytope

0 references

Facet Obtaining Procedures for Set Packing Problems

0 references

New formulations for the uncapacitated multiple allocation hub location problem

0 references

L-shaped decomposition of two-stage stochastic programs with integer recourse

0 references

Dual decomposition in stochastic integer programming

0 references

Combinatorial auctions: a survey

0 references

Approximating the stochastic Knapsack problem: the benefit of adaptivity

0 references

Adaptivity and approximation for stochastic packing problems

0 references

On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming

0 references

A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes

0 references

On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty

0 references

A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems

0 references

BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems

0 references

Stochastic Covering and Adaptivity

0 references

Q4428687

0 references

Lagrangean relaxation. (With comments and rejoinder).

0 references

The Traveling-Salesman Problem and Minimum Spanning Trees

0 references

Q2762573

0 references

Optimizing electricity distribution using two-stage integer recourse models

0 references

The integer \(L\)-shaped method for stochastic integer programs with complete recourse

0 references

An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands

0 references

A heuristic procedure for stochastic integer programs with complete recourse

0 references

Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

0 references

The Stochastic Machine Replenishment Problem

0 references

Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms

0 references

The million-variable ``march'' for stochastic combinatorial optimization

0 references

A comparative study of decomposition algorithms for stochastic combinatorial optimization

0 references

From stochastic dominance to mean-risk models: Semideviations as risk measures

0 references

On the facial structure of set packing polyhedra

0 references

Probabilistic construction of deterministic algorithms: approximating packing integer programs

0 references

Scenarios and Policy Aggregation in Optimization Under Uncertainty

0 references

Q2762572

0 references

A stochastic programming approach for supply chain network design under uncertainty

0 references

Stochastic programming with integer variables

0 references

A stochastic integer programming model for incorporating day-ahead trading of electricity into hydro-thermal unit commitment

0 references

Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse

0 references

Conditional value-at-risk in stochastic programs with mixed-integer recourse

0 references

Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming

0 references

The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification

0 references

Two-stage stochastic hierarchical multiple risk problems: Models and algorithms

0 references

On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables

0 references

Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs

0 references

Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs

0 references

Identifiers

zbMATH Open document ID

1250.90047

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1016/J.EJOR.2010.11.022

0 references

Sitelinks

Mathematics(1 entry)

mardi Stochastic set packing problem