Chance-Constrained Binary Packing Problems
From MaRDI portal
Recommendations
- Probabilistic behaviour of optimal bin-packing solutions
- Branch and Price for Chance-Constrained Bin Packing
- Probabilistic Analysis of a Generalized Bin Packing Problem and Applications
- Probabilistic bounds for dual bin-packing
- Probabilistic Analysis of Bin Packing Heuristics
- scientific article; zbMATH DE number 176070
- The stochastic generalized bin packing problem
- Cardinality constrained bin-packing problems
- Stochastic set packing problem
Cites work
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- An integer programming and decomposition approach to general chance-constrained mathematical programs
- An integer programming approach for linear programs with probabilistic constraints
- Capital rationing problems under uncertainty and risk
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Convex Approximations of Chance Constrained Programs
- Covering linear programming with violations
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
- Easily Computable Facets of the Knapsack Polytope
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Facets of the Knapsack Polytope From Minimal Covers
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Local cuts for mixed-integer programming
- MIP reformulations of the probabilistic set covering problem
- On mixing sets arising in chance-constrained programming
- Pattern-based modeling and solution of probabilistically constrained optimization problems
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Regularization methods for optimization problems with probabilistic constraints
- Sample average approximation method for chance constrained programming: Theory and applications
- Scenario approximations of chance constraints
- Separation algorithms for 0-1 knapsack polytopes
- Sequence Independent Lifting for Mixed-Integer Programming
- Sequence independent lifting in mixed integer programming
- Technical Note—A Note on Zero-One Programming
- The Probabilistic Set-Covering Problem
- The Scenario Approach to Robust Control Design
- The submodular knapsack polytope
- Uncertain convex programs: randomized solutions and confidence levels
Cited in
(47)- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
- Lifting of probabilistic cover inequalities
- Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
- An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
- An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
- Nonlinear chance-constrained problems with applications to hydro scheduling
- Robust concave utility maximization over chance constraints
- Branch and Price for Chance-Constrained Bin Packing
- On quantile cuts and their closure for chance constrained optimization problems
- Distributionally robust joint chance-constrained programming with Wasserstein metric
- Scalable algorithms for the sparse ridge regression
- A sequential algorithm for solving nonlinear optimization problems with chance constraints
- Decomposition algorithms for two-stage chance-constrained programs
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
- Stochastic set packing problem
- Probabilistic partial set covering with an oracle for chance constraints
- Adaptive partitioning for chance-constrained problems with finite support
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- Chance-constrained economic dispatch with renewable energy and storage
- Solving chance-constrained problems via a smooth sample-based nonlinear approximation
- On distributionally robust chance constrained programs with Wasserstein distance
- Exact algorithms for the 0-1 time-bomb knapsack problem
- Relaxations and approximations of chance constraints under finite distributions
- On the quantile cut closure of chance-constrained problems
- Robust policies for a multi-period fleet sizing problem with demand uncertainty
- Wasserstein distributionally robust chance-constrained program with moment information
- Exact algorithms for the chance-constrained vehicle routing problem
- An efficient computational method for large scale surgery scheduling problems with chance constraints
- An algorithm for binary linear chance-constrained problems using IIS
- Distributionally robust optimization problem with probabilistic envelope constraints over Wasserstein ball
- On deterministic reformulations of distributionally robust joint chance constrained optimization problems
- Exact algorithms for the chance-constrained vehicle routing problem
- A new sequential lifting of robust cover inequalities
- Optimized Bonferroni approximations of distributionally robust joint chance constraints
- Risk-averse shortest path interdiction
- Chance-constrained set covering with Wasserstein ambiguity
- A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation
- Partial sample average approximation method for chance constrained problems
- Cutting and packing problems under uncertainty: literature review and classification framework
- An embarrassingly parallel method for large-scale stochastic programs
- Derivative-free approaches for chance-constrained problems with right-hand side uncertainty
- A polyhedral study of the static probabilistic lot-sizing problem
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
- ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
This page was built for publication: Chance-Constrained Binary Packing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940063)
