A heuristic column generation approach for the stochastic bin packing problem

DOI10.1007/978-3-031-24907-5_16MaRDI QIDQ6606532FDOQ6606532

Authors: J. Martinovic, Nico Strasdat, Jean-François Côté, Vinícius Loti de Lima 

Publication date: 17 September 2024

Recommendations

• Mathematical models and approximate solution approaches for the stochastic bin packing problem
• The stochastic generalized bin packing problem
• Branch and Price for Chance-Constrained Bin Packing
• An introduction to stochastic bin packing-based server consolidation with conflicts
• Algorithms for the bin packing problem with scenarios

zbMATH Keywords

heuristicsnormal distributioncutting and packingcolumn generationstochastic bin packing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic programming (90C15)

Cites Work

• A PTAS for the chance-constrained knapsack problem with random item sizes
• A robust approach to the chance-constrained knapsack problem
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• The stochastic generalized bin packing problem
• Mathematical models and approximate solution approaches for the stochastic bin packing problem
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation

This page was built for publication: A heuristic column generation approach for the stochastic bin packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606532)