The stochastic generalized bin packing problem
From MaRDI portal
Publication:423955
DOI10.1016/j.dam.2011.10.037zbMath1239.90090OpenAlexW1976142682WikidataQ58644411 ScholiaQ58644411MaRDI QIDQ423955
Guido Perboli, Roberto Tadei, Mauro Maria Baldi
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.037
Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Related Items
Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic ⋮ Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT ⋮ Mathematical models and approximate solution approaches for the stochastic bin packing problem ⋮ The bin packing problem with item fragmentation: a worst-case analysis ⋮ Cutting and packing problems under uncertainty: literature review and classification framework ⋮ The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A generalized bin packing problem for parcel delivery in last-mile logistics ⋮ Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation ⋮ The multi-Handler knapsack problem under uncertainty ⋮ Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On two-stage stochastic knapsack problems
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- Optimal Bin Packing with Items of Random Sizes III
- The stochastic knapsack problem
- A Heuristic Algorithm for the Auto-Carrier Transportation Problem
- On Line Bin Packing with Items of Random Size
