Chance-Constrained Binary Packing Problems
From MaRDI portal
Publication:2940063
DOI10.1287/ijoc.2014.0595zbMath1304.90179MaRDI QIDQ2940063
Yongjia Song, Simge Küçükyavuz, James R. Luedtke
Publication date: 26 January 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3cfda5056c53338de90ab32e890c73b0312b3b7a
Related Items
Probabilistic Partial Set Covering with an Oracle for Chance Constraints, A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints, On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems, Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information, Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs, 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, An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems, Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation, Scalable Algorithms for the Sparse Ridge Regression, An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse, Cutting and packing problems under uncertainty: literature review and classification framework, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, A solution algorithm for chance-constrained problems with integer second-stage recourse decisions, Wasserstein distributionally robust chance-constrained program with moment information, Decomposition algorithms for two-stage chance-constrained programs, Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints, Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs, Chance-constrained economic dispatch with renewable energy and storage, Relaxations and approximations of chance constraints under finite distributions, A polyhedral study of the static probabilistic lot-sizing problem, Lifting of probabilistic cover inequalities, An efficient computational method for large scale surgery scheduling problems with chance constraints, Exact algorithms for the chance-constrained vehicle routing problem, On quantile cuts and their closure for chance constrained optimization problems, Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens, Optimized Bonferroni approximations of distributionally robust joint chance constraints, Nonlinear chance-constrained problems with applications to hydro scheduling, Exact algorithms for the 0-1 time-bomb knapsack problem, On distributionally robust chance constrained programs with Wasserstein distance, Partial sample average approximation method for chance constrained problems, An algorithm for binary linear chance-constrained problems using IIS, Chance-constrained set covering with Wasserstein ambiguity, A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation, Risk-Averse Shortest Path Interdiction, Exact Algorithms for the Chance-Constrained Vehicle Routing Problem, On the Quantile Cut Closure of Chance-Constrained Problems, An Embarrassingly Parallel Method for Large-Scale Stochastic Programs, Branch and Price for Chance-Constrained Bin Packing
Uses Software
Cites Work
- Unnamed Item
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Capital rationing problems under uncertainty and risk
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- MIP reformulations of the probabilistic set covering problem
- An integer programming approach for linear programs with probabilistic constraints
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Sample average approximation method for chance constrained programming: Theory and applications
- The submodular knapsack polytope
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Uncertain convex programs: randomized solutions and confidence levels
- Regularization methods for optimization problems with probabilistic constraints
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Sequence independent lifting in mixed integer programming
- Local cuts for mixed-integer programming
- On mixing sets arising in chance-constrained programming
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Separation algorithms for 0-1 knapsack polytopes
- Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
- Covering Linear Programming with Violations
- Easily Computable Facets of the Knapsack Polytope
- An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- The Probabilistic Set-Covering Problem
- Sequence Independent Lifting for Mixed-Integer Programming
- Technical Note—A Note on Zero-One Programming
- Facets of the Knapsack Polytope From Minimal Covers
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems
- The Scenario Approach to Robust Control Design
- Convex Approximations of Chance Constrained Programs
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
- Concavity and efficient points of discrete distributions in probabilistic programming.
