论文信息 - Heuristic and exact algorithms for Generalized Bin Covering Problem

Heuristic and exact algorithms for Generalized Bin Covering Problem

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.

[1] Alexander Souza,et al. Approximation Algorithms for Generalized and Variable-Sized Bin Covering , 2012, APPROX-RANDOM.

[2] Joseph Y.-T. Leung,et al. On a Dual Version of the One-Dimensional Bin Packing Problem , 1984, J. Algorithms.

[3] M. Jünger,et al. 50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art , 2010 .

[4] Paul E. Black,et al. Dictionary of Algorithms and Data Structures | NIST , 1998 .

[5] Susan Fera. Assmann. Problems in discrete applied mathematics , 1983 .

[6] Gerhard J. Woeginger,et al. On-line Packing and Covering Problems , 1996, Online Algorithms.

[7] Leah Epstein. Online Variable Sized Covering , 2001, Inf. Comput..

[8] Richard E. Korf,et al. Bin-Completion Algorithms for Multicontainer Packing and Covering Problems , 2005, IJCAI.

[9] J. B. G. Frenk,et al. Two Simple Algorithms for bin Covering , 1999, Acta Cybern..

[10] Fedor V. Fomin,et al. Exact exponential algorithms , 2013, CACM.

[11] Klaus Jansen,et al. An asymptotic fully polynomial time approximation scheme for bin covering , 2003, Theor. Comput. Sci..

[12] János Csirik,et al. Online algorithms for a dual version of bin packing , 1988, Discret. Appl. Math..

[13] Claire Mathieu,et al. Better approximation algorithms for bin covering , 2001, SODA '01.