Branch and Price for Chance-Constrained Bin Packing
From MaRDI portal
Publication:3386782
DOI10.1287/ijoc.2019.0894OpenAlexW2998960987WikidataQ126358455 ScholiaQ126358455MaRDI QIDQ3386782
Xiaolan Xie, Zheng Zhang, Brian T. Denton
Publication date: 7 January 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2019.0894
Related Items (9)
Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms ⋮ Frameworks and results in distributionally robust optimization ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ 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 ⋮ Scheduling jobs with normally distributed processing times on parallel machines ⋮ Robust drone selective routing in humanitarian transportation network assessment
Cites Work
- Unnamed Item
- Decomposition algorithms for two-stage chance-constrained programs
- A 13/12 approximation algorithm for bin packing with extendable bins
- Data-driven chance constrained stochastic program
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Sample average approximation method for chance constrained programming: Theory and applications
- Partitioning procedures for solving mixed-variables programming problems
- An exact algorithm for IP column generation
- On robust optimization of two-stage systems
- Scheduling space-sharing for internet advertising
- Exact algorithms for the chance-constrained vehicle routing problem
- On distributionally robust chance-constrained linear programs
- Solving a class of stochastic mixed-integer programs with branch and price
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling
- Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones
- Operating Room Pooling and Parallel Surgery Processing Under Uncertainty
- Chance-Constrained Binary Packing Problems
- Covering Linear Programming with Violations
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
- Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- An Application of Bin-Packing to Multiprocessor Scheduling
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
This page was built for publication: Branch and Price for Chance-Constrained Bin Packing
