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

DOI10.1007/S10100-022-00798-1MaRDI QIDQ6100671zbMATH OpenOpenAlexFDO

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

Publication date 22 June 2023

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10100-022-00798-1

zbMATH Keywords

bin coveringbin packingmetaheuristics

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Bin covering with delivery and solving it with evolution of algorithms
• Bin covering with a general profit function: approximability results
• A min-cost bin covering problem and its algorithm
• Better approximation algorithms for bin covering
• Optimal on-line algorithms for variable-sized bin covering

Cites work

• Bin covering with a general profit function: approximability results
• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1324231 (Why is no real title available?)
• Improved Space for Bounded-Space, On-Line Bin-Packing
• On bin packing with clustering and bin packing with delays
• On the machine scheduling problem with job delivery coordination
• On-line bin packing ? A restricted survey
• Online bin packing with delay and holding costs
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6100671)