scientific article

zbMATH Open1223.90028MaRDI QIDQ3021055

Hongwen Qu

Publication date: 5 August 2011

Title of this publication is not available (Why is that?)

zbMATH Keywords

heuristic algorithmbin covering problem

Mathematics Subject Classification ID

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

Related Items (2)

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

Recommendations

• Lower bounds and algorithms for the minimum cardinality bin covering problem 👍 👎
• Cardinality constrained bin-packing problems 👍 👎
• Bin covering with cardinality constraints 👍 👎
• The minimum cut cover problem 👍 👎
• Min-Power Covering Problems 👍 👎
• Minimum-diameter covering problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)