Mathematical models and approximate solution approaches for the stochastic bin packing problem
From MaRDI portal
Publication:2669539
DOI10.1016/j.cor.2021.105439OpenAlexW3173739011MaRDI QIDQ2669539
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105439
heuristicslinearizationnormal distributionlower boundscutting and packingstochastic bin packing problem
Related Items (1)
Uses Software
Cites Work
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- The stochastic generalized bin packing problem
- On two-stage stochastic knapsack problems
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A robust approach to the chance-constrained knapsack problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- LP models for bin packing and cutting stock problems
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Solving multistatic sonar location problems with mixed-integer programming
- A branch-and-price algorithm for the temporal bin packing problem
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
- Mathematical Methods of Organizing and Planning Production
- Dual Inequalities for Stabilized Column Generation Revisited
- Using Extra Dual Cuts to Accelerate Column Generation
- A Stochastic Model for Estimating the Power Consumption of a Processor
- A Linear Programming Approach to the Cutting-Stock Problem
- Optimal Bin Packing with Items of Random Sizes
- A New Linear Programming Approach to the Cutting Stock Problem
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- An Application of Bin-Packing to Multiprocessor Scheduling
- A Primer on Statistical Distributions
- Allocating Bandwidth for Bursty Connections
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables
This page was built for publication: Mathematical models and approximate solution approaches for the stochastic bin packing problem
