{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:25:13Z","timestamp":1743071113518,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031226946"},{"type":"electronic","value":"9783031226953"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22695-3_45","type":"book-chapter","created":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T15:11:58Z","timestamp":1669993918000},"page":"646-660","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Operation-based Greedy Algorithm for\u00a0Discounted Knapsack Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9006-4101","authenticated-orcid":false,"given":"Binh Thanh","family":"Dang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6930-6863","authenticated-orcid":false,"given":"Bach Hoai","family":"Nguyen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2789-680X","authenticated-orcid":false,"given":"Peter","family":"Andreae","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,3]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., Martello, S.: Knapsack problems - an overview of recent advances. Part I: single knapsack problems. Comput. Oper. Res. 143, 105692 (2022)","DOI":"10.1016\/j.cor.2021.105692"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Dang, B.T., Truong, T.K.: Binary salp swarm algorithm for discounted $$\\{0-1\\}$$ knapsack problem. PLOS ONE 17(4), 1\u201328 (2022)","DOI":"10.1371\/journal.pone.0266537"},{"issue":"2","key":"45_CR3","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig, G.B.: Discrete-variable extremum problems. Oper. Res. 5(2), 266\u2013288 (1957)","journal-title":"Oper. Res."},{"issue":"2","key":"45_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00355-011-0603-9","volume":"40","author":"P Emerson","year":"2013","unstructured":"Emerson, P.: The original Borda count and partial voting. Social Choice Welfare 40(2), 353\u2013358 (2013)","journal-title":"Social Choice Welfare"},{"key":"45_CR5","unstructured":"Guldan, B.: Heuristic and exact algorithms for discounted knapsack problems. University of Erlangen-N\u00fcrnberg, Germany (2007)"},{"key":"45_CR6","doi-asserted-by":"publisher","unstructured":"Haynes, W.: Wilcoxon Rank Sum Test, pp. 2354\u20132355. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-9863-7_1185","DOI":"10.1007\/978-1-4419-9863-7_1185"},{"issue":"12","key":"45_CR7","first-page":"2614","volume":"39","author":"YC He","year":"2016","unstructured":"He, Y.C., Wang, X.Z., Li, W.B., Zhang, X.L., Chen, Y.Y.: Research on genetic algorithms for the discounted $$\\{0-1\\}$$ knapsack problem. Jisuanji Xuebao\/Chin. J. Comput. 39(12), 2614\u20132630 (2016)","journal-title":"Jisuanji Xuebao\/Chin. J. Comput."},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"He, Y.C., Wang, X.Z., He, Y.L., Zhao, S.L., Li, W.B.: Exact and approximate algorithms for discounted $$\\{0-1\\}$$ knapsack problem. Inf. Sci. 369(C), 634\u2013647 (2016)","DOI":"10.1016\/j.ins.2016.07.037"},{"key":"45_CR9","unstructured":"He, Y.: Four kinds of D$$\\{0-1\\}$$KP instances. ResearchGate (2019)"},{"key":"45_CR10","doi-asserted-by":"publisher","first-page":"104445","DOI":"10.1016\/j.knosys.2018.07.045","volume":"219","author":"Y He","year":"2021","unstructured":"He, Y., Wang, X.: Group theory-based optimization algorithm for solving knapsack problems. Knowl.-Based Syst. 219, 104445 (2021)","journal-title":"Knowl.-Based Syst."},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1016\/j.asoc.2019.01.049","volume":"77","author":"Y He","year":"2019","unstructured":"He, Y., Wang, X., Gao, S.: Ring theory-based evolutionary algorithm and its application to D0\u20131 KP. Appl. Soft Comput. 77, 714\u2013722 (2019)","journal-title":"Appl. Soft Comput."},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"3350","DOI":"10.1007\/s10489-020-01722-3","volume":"50","author":"Y Li","year":"2020","unstructured":"Li, Y., He, Y., Liu, X., Guo, X., Li, Z.: A novel discrete whale optimization algorithm for solving knapsack problems. Appl. Intell. 50, 3350\u20133366 (2020)","journal-title":"Appl. Intell."},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Mathews, G.B.: On the partition of numbers. Proc. Lond. Math. Soc. s1\u201328(1), 486\u2013490 (1896)","DOI":"10.1112\/plms\/s1-28.1.486"},{"issue":"2","key":"45_CR14","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1109\/TCYB.2019.2944141","volume":"51","author":"BH Nguyen","year":"2021","unstructured":"Nguyen, B.H., Xue, B., Andreae, P., Zhang, M.: A new binary particle swarm optimization approach: momentum and dynamic balance between exploration and exploitation. IEEE Trans. Cybern. 51(2), 589\u2013603 (2021)","journal-title":"IEEE Trans. Cybern."},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"100663","DOI":"10.1016\/j.swevo.2020.100663","volume":"54","author":"BH Nguyen","year":"2020","unstructured":"Nguyen, B.H., Xue, B., Zhang, M.: A survey on swarm intelligence approaches to feature selection in data mining. Swarm Evol. Comput. 54, 100663 (2020)","journal-title":"Swarm Evol. Comput."},{"issue":"6","key":"45_CR16","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.3390\/sym14061208","volume":"14","author":"A Sulaiman","year":"2022","unstructured":"Sulaiman, A., Sadiq, M., Mehmood, Y., Akram, M., Ali, G.A.: Fitness-based acceleration coefficients binary particle swarm optimization to solve the discounted knapsack problem. Symmetry 14(6), 1208 (2022)","journal-title":"Symmetry"},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"Truong, T.K.: different transfer functions for binary particle swarm optimization with a new encoding scheme for discounted $$\\{0-1\\}$$ knapsack problem. Math. Prob. Eng. 2021 (2021)","DOI":"10.1155\/2021\/2864607"},{"key":"45_CR18","doi-asserted-by":"publisher","unstructured":"Wilbaut, C., Hanafi, S., Coelho, I.M., Lucena, A.: The knapsack problem and its variants: formulations and solution methods. In: The Palgrave Handbook of Operations Research, pp. 105\u2013151. Springer, Heidelberg (2022),https:\/\/doi.org\/10.1007\/978-3-030-96935-6_4","DOI":"10.1007\/978-3-030-96935-6_4"},{"key":"45_CR19","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1007\/s10489-020-01652-0","volume":"50","author":"C Wu","year":"2020","unstructured":"Wu, C., Zhao, J., Feng, Y., Lee, M.: Solving discounted $$\\{0-1\\}$$ knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm. Appl. Intell. 50, 1872\u20131888 (2020)","journal-title":"Appl. Intell."},{"issue":"4","key":"45_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1504\/IJBIC.2017.087924","volume":"10","author":"H Zhu","year":"2017","unstructured":"Zhu, H., He, Y.C., Wang, X., Tsang, E.C.: Discrete differential evolutions for the discounted $$\\{0-1\\}$$ knapsack problem. Int. J. Bio-Inspired Comput. 10(4), 219\u2013238 (2017)","journal-title":"Int. J. Bio-Inspired Comput."}],"container-title":["Lecture Notes in Computer Science","AI 2022: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22695-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:31:41Z","timestamp":1710257501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22695-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031226946","9783031226953"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22695-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perth, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ajcai2022.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}