scientific article; zbMATH DE number 5936584

MaRDI QIDQ3021055zbMATH OpenFDO

Authors Hongwen Qu

Publication date 5 August 2011

zbMATH Keywords

bin covering problemheuristic algorithm

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Lower bounds and algorithms for the minimum cardinality bin covering problem
• A min-cost bin covering problem and its algorithm
• Bin covering with cardinality constraints
• The complexity of the minimum k-cover problem
• Min-Power Covering Problems
• The minimum cut cover problem
• Minimum-diameter covering problems
• scientific article; zbMATH DE number 5583574
• scientific article; zbMATH DE number 59833
• Cardinality constrained bin-packing problems

Cited in

(2)

• The minimum likely column cover problem
• Bin covering with cardinality constraints

This page was built for publication:

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