Zhou Xu, Xiaofan Lai. A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint. In Frank Dehne, John Iacono, Jörg-Rüdiger Sack, editors, Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings. Volume 6844 of Lecture Notes in Computer Science, pages 704-715, Springer, 2011. [doi]
Abstract is missing.