Papers Summery
Budget: $10 – $30 CAD
I would like to get in tech with someone who can help me summarize some papers. I want each summarized paper to be in 5 to 6 lines.
These are the papers:
1. Pisinger, D., 1999. Core problems in knapsack algorithms. Operations Research, 47(4), pp.570-575.
2. Akçay, Y., Li, H. and Xu, S.H., 2007. Greedy algorithm for the general multidimensional knapsack problem. Annals of Operations Research, 150(1), pp.17-29.
3. Ferdosian, N., Othman, M., Ali, B.M. and Lun, K.Y., 2016. Greedy–knapsack algorithm for optimal downlink resource allocation in LTE networks. Wireless Networks, 22(5), pp.1427-1440.
4. Chowdu, A., Nesbitt, P., Brickey, A. and Newman, A.M., 2021. Operations research in underground mine planning: A review. INFORMS Journal on Applied Analytics.
These are the papers:
1. Pisinger, D., 1999. Core problems in knapsack algorithms. Operations Research, 47(4), pp.570-575.
2. Akçay, Y., Li, H. and Xu, S.H., 2007. Greedy algorithm for the general multidimensional knapsack problem. Annals of Operations Research, 150(1), pp.17-29.
3. Ferdosian, N., Othman, M., Ali, B.M. and Lun, K.Y., 2016. Greedy–knapsack algorithm for optimal downlink resource allocation in LTE networks. Wireless Networks, 22(5), pp.1427-1440.
4. Chowdu, A., Nesbitt, P., Brickey, A. and Newman, A.M., 2021. Operations research in underground mine planning: A review. INFORMS Journal on Applied Analytics.