Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6898048 | European Journal of Operational Research | 2013 | 10 Pages |
Abstract
⺠We introduce a variant of the GAP including minimum quantities. ⺠We provide complexity and approximation results on different variants of the problem. ⺠Polynomial time (1, 2)-approximation algorithm for the general problem with fixed number of bins. ⺠Computational results indicate that the (1, 2)-approximation algorithm outputs good solutions in practice.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Sven O. Krumke, Clemens Thielen,