A heuristic column generation approach for the stochastic bin packing problem

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

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

Publication date: 17 September 2024

zbMATH Keywords

heuristicscolumn generationnormal distributioncutting and packingstochastic bin packing problem

Mathematics Subject Classification ID

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

Cites Work

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

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)