Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
From MaRDI portal
Publication:5084621
DOI10.1287/ijoc.2020.1010OpenAlexW3134148887MaRDI QIDQ5084621
Shan-shan Wang, Jinlin Li, Sanjay Mehrotra
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1010
valid inequalitiesbranch-and-cutbin packingoperating room planningchance-constrained stochastic programmingbilinear integer program
Related Items
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, Wasserstein distributionally robust chance-constrained program with moment information
Cites Work
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- An integer programming approach for linear programs with probabilistic constraints
- Sample average approximation of expected value constrained stochastic programs
- 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
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Relaxations and approximations of chance constraints under finite distributions
- A polyhedral study on chance constrained program with random right-hand side
- On quantile cuts and their closure for chance constrained optimization problems
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Two-dimensional packing problems: a survey
- Algorithms for the variable sized bin packing problem
- On safe tractable approximations of chance constraints
- Sequence independent lifting in mixed integer programming
- Fully dynamic bin packing revisited
- On mixing sets arising in chance-constrained programming
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Solving the variable size bin packing problem with discretized formulations
- Chance-Constrained Programming
- Scalable Heuristics for a Class of Chance-Constrained Stochastic Programs
- Chance-Constrained Binary Packing Problems
- Covering Linear Programming with Violations
- Introduction to Stochastic Programming
- Easily Computable Facets of the Knapsack Polytope
- Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Branch and Price for Chance-Constrained Bin Packing
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Dynamic Bin Packing
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Facets of the knapsack polytope
- Allocating Bandwidth for Bursty Connections
- The Three-Dimensional Bin Packing Problem
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
- Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
- On the facial structure of set packing polyhedra
- Convex Approximations of Chance Constrained Programs
- The mixed vertex packing problem.
- Mixing mixed-integer inequalities
