On online bin packing with LIB constraints

DOI10.1002/nav.20383zbMath1180.90267OpenAlexW2032316927MaRDI QIDQ3655570

Leah Epstein

Publication date: 8 January 2010

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.7779

zbMATH Keywords

competitive analysisonline algorithmsbin packingfirst-fit

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (7)

Bin packing with ``largest in bottom constraint: tighter bounds and generalizations ⋮ Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions ⋮ Colored bin packing: online algorithms and lower bounds ⋮ More on ordered open end bin packing ⋮ Bin packing with directed stackability conflicts ⋮ Online results for black and white bin packing ⋮ Comparing the costs of any fit algorithms for bin packing

Cites Work

• Fast algorithms for bin packing
• On the online bin packing problem
• A simple on-line bin-packing algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: On online bin packing with LIB constraints