Bin packing problem with scenarios

DOI10.1007/s10100-018-0574-3OpenAlexW2888524728MaRDI QIDQ2418155

János Balogh, Attila Bódis

Publication date: 3 June 2019

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-018-0574-3

zbMATH Keywords

competitive analysisonline algorithmsbin packing problemscenarios

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Approximation algorithms (68W25) Operations research and management science (90Bxx)

Related Items

Cutting and packing problems under uncertainty: literature review and classification framework, Editorial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single machine scheduling problems with uncertain parameters and the OWA criterion
• New lower bounds for certain classes of bin packing algorithms
• Robust solutions of linear programming problems contaminated with uncertain data
• Minimizing worst-case and average-case makespan over scenarios
• Fast algorithms for bin packing
• Approximating the min-max (regret) selecting items problem
• Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios
• Parallel Machine Scheduling under Uncertainty
• A simple on-line bin-packing algorithm
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• A Stochastic Programming Model
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming