Branch and Price for Chance-Constrained Bin Packing
From MaRDI portal
Recommendations
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- A branch-and-price algorithm for the bin packing problem with conflicts
- Solving robust bin-packing problems with a branch-and-price approach
- Chance-Constrained Binary Packing Problems
- The price of fixed assignments in stochastic extensible bin packing
- Probabilistic behaviour of optimal bin-packing solutions
- A branch-and-price algorithm for the temporal bin packing problem
- The stochastic generalized bin packing problem
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
Cites work
- A 13/12 approximation algorithm for bin packing with extendable bins
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling
- 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
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
- An Application of Bin-Packing to Multiprocessor Scheduling
- An exact algorithm for IP column generation
- Branch-and-price: Column generation for solving huge integer programs
- Chance-Constrained Binary Packing Problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Covering linear programming with violations
- Dantzig-Wolfe decomposition for solving multistage stochastic capacity-planning problems
- Data-driven chance constrained stochastic program
- Decomposition algorithms for two-stage chance-constrained programs
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Exact algorithms for the chance-constrained vehicle routing problem
- scientific article; zbMATH DE number 772850 (Why is no real title available?)
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- On distributionally robust chance-constrained linear programs
- On robust optimization of two-stage systems
- Operating room pooling and parallel surgery processing under uncertainty
- Optimal allocation of surgery blocks to operating rooms under uncertainty
- Partitioning procedures for solving mixed-variables programming problems
- Sample average approximation method for chance constrained programming: Theory and applications
- Scheduling arrivals to a stochastic service delivery system using copositive cones
- Scheduling space-sharing for internet advertising
- Solving a class of stochastic mixed-integer programs with branch and price
Cited in
(17)- Robust drone selective routing in humanitarian transportation network assessment
- Frameworks and results in distributionally robust optimization
- Scheduling jobs with normally distributed processing times on parallel machines
- Chance-Constrained Binary Packing Problems
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- 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
- Branch and Price for Submodular Bin Packing
- A heuristic column generation approach for the stochastic bin packing problem
- A distributionally robust optimisation with joint chance constraints approach for location-routing problem in urban search and rescue operations
- Sequencing and scheduling appointments with weighted completion time minimization and waiting time tolerance
- Robust concave utility maximization over chance constraints
- A branch and price algorithm for scheduling in surgery pre-admission testing clinics
- Optimizing surgery scheduling under post-anesthesia care unit capacity constraints and random services durations
This page was built for publication: Branch and Price for Chance-Constrained Bin Packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386782)
