The bin covering with delivery problem, extended investigations for the online case

DOI10.1007/s10100-022-00798-1OpenAlexW4225134123MaRDI QIDQ6100671

Tibor Dulai, György Dósa, Agnes Werner-Stark, Zsolt Tuza, Peter Auer, Gyula Abraham

Publication date: 22 June 2023

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-022-00798-1

zbMATH Keywords

metaheuristicsbin coveringbin packing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bin covering with a general profit function: approximability results
• On the machine scheduling problem with job delivery coordination
• On bin packing with clustering and bin packing with delays
• Online bin packing with delay and holding costs
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
• Improved Space for Bounded-Space, On-Line Bin-Packing
• On-line bin packing ? A restricted survey

This page was built for publication: The bin covering with delivery problem, extended investigations for the online case