Cutting and packing problems under uncertainty: literature review and classification framework
From MaRDI portal
Publication:6056892
DOI10.1111/itor.13318MaRDI QIDQ6056892
José Fernando Oliveira, Elsa Silva, Khadija Hadj Salem
Publication date: 4 October 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
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
- The stochastic generalized bin packing problem
- Capital rationing problems under uncertainty and risk
- On the cutting stock problem under stochastic demand
- Stochastic set packing problem
- The stochastic trim-loss problem
- Product packing and stacking under uncertainty: a robust approach
- BPPLIB: a library for bin packing and cutting stock problems
- Production planning in furniture settings via robust optimization
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Exact solution techniques for two-dimensional cutting and packing
- Queue-constrained packing: a vehicle ferry case study
- Solving robust bin-packing problems with a branch-and-price approach
- Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
- A branch and price approach for the robust bandwidth packing problem with queuing delays
- 2DPackLib: a two-dimensional cutting and packing library
- An introduction to stochastic bin packing-based server consolidation with conflicts
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Irregular packing problems: a review of mathematical models
- Chance-Constrained Submodular Knapsack problem
- An application of deterministic and robust optimization in the wood cutting industry
- The one-dimensional cutting stock problem with usable leftovers -- a survey
- Approximation and online algorithms for multidimensional bin packing: a survey
- Bin packing problem with scenarios
- An improved typology of cutting and packing problems
- Solving the one-dimensional cutting stock problem under discrete, uncertain, time-varying demands using a hybrid of special-purpose Benders' decomposition and column generation
- Mathematical models and approximate solution approaches for the stochastic bin packing problem
- Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem
- Determining the best shipper sizes for sending products to customers
- Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints
- Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
- Chance-Constrained Binary Packing Problems
- Uncertainty feature optimization: An implicit paradigm for problems with noisy data
- Branch and Price for Chance-Constrained Bin Packing
- Heuristic policies for stochastic knapsack problem with time‐varying random demand
- On-line bin packing ? A restricted survey
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
- Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers
- A mixed‐integer linear programming model and a metaheuristic approach for the selection and allocation of land parcels problem
- Improved bounds for stochastic extensible bin packing under distributional assumptions
- A stochastic programming approach to the cutting stock problem with usable leftovers
- A reinforcement learning approach to the stochastic cutting stock problem
This page was built for publication: Cutting and packing problems under uncertainty: literature review and classification framework