Chekuri, C., & Khanna, S. (2005). A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. SIAM journal on computing, 35(3), 713-728. https://doi.org/10.1137/S0097539700382820
Chicago Style (17th ed.) CitationChekuri, Chandra, and Sanjeev Khanna. "A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem." SIAM Journal on Computing 35, no. 3 (2005): 713-728. https://doi.org/10.1137/S0097539700382820.
MLA (9th ed.) CitationChekuri, Chandra, and Sanjeev Khanna. "A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem." SIAM Journal on Computing, vol. 35, no. 3, 2005, pp. 713-728, https://doi.org/10.1137/S0097539700382820.
Warning: These citations may not always be 100% accurate.