Bin covering with a general profit function: approximability results

DOI10.1007/S10100-012-0269-0zbMath1339.90189OpenAlexW2046939398MaRDI QIDQ301139

Zsolt Tuza, Attila Benko, György Dósa

Publication date: 29 June 2016

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-012-0269-0

zbMATH Keywords

approximation algorithmbin coveringnon-approximabilitypolynomial-time exact algorithm

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

The bin covering with delivery problem, extended investigations for the online case ⋮ Online results for black and white bin packing

Cites Work

• On the machine scheduling problem with job delivery coordination
• Bounded-space online bin cover
• Unnamed Item

This page was built for publication: Bin covering with a general profit function: approximability results