A min-cost bin covering problem and its algorithm

MaRDI QIDQ5319473zbMATH OpenFDO

Authors Dingqiang Yang, Dongqing Xie

Publication date 22 July 2009

zbMATH Keywords

approximation algorithmsasymptotic competitive ratiobin covering problemcombinational optimization

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Optimal on-line algorithms for variable-sized bin covering
• On the sum minimization version of the online bin covering problem
• Approximation algorithms for generalized and variable-sized bin covering
• On lazy bin covering and packing problems
• Computing and Combinatorics

Cited in

(10)

• Lower bounds and algorithms for the minimum cardinality bin covering problem
• Bin covering with cardinality constraints
• An optimal algorithm for the minimum disc cover problem
• Two simple algorithms for bin covering
• Bin covering with delivery and solving it with evolution of algorithms
• Bin covering with a general profit function: approximability results
• scientific article; zbMATH DE number 5936584 (Why is no real title available?)
• scientific article; zbMATH DE number 1779967 (Why is no real title available?)
• The bin covering with delivery problem, extended investigations for the online case
• On the sum minimization version of the online bin covering problem

This page was built for publication: A min-cost bin covering problem and its algorithm

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