Cite
An iterative rounding strategy-based algorithm for the set-union knapsack problem
MLA
Isma Dahmani, et al. “An Iterative Rounding Strategy-Based Algorithm for the Set-Union Knapsack Problem.” Soft Computing, vol. 25, Aug. 2021, pp. 13617–39. EBSCOhost, https://doi.org/10.1007/s00500-021-06091-8.
APA
Isma Dahmani, Mhand Hifi, & Meriem Ferroum. (2021). An iterative rounding strategy-based algorithm for the set-union knapsack problem. Soft Computing, 25, 13617–13639. https://doi.org/10.1007/s00500-021-06091-8
Chicago
Isma Dahmani, Mhand Hifi, and Meriem Ferroum. 2021. “An Iterative Rounding Strategy-Based Algorithm for the Set-Union Knapsack Problem.” Soft Computing 25 (August): 13617–39. doi:10.1007/s00500-021-06091-8.