{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:55:37Z","timestamp":1757620537864,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502141"},{"type":"electronic","value":"9789819502158"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-0215-8_9","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T16:25:29Z","timestamp":1753979129000},"page":"109-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Discrete Effort Distribution via\u00a0Regret-Enabled Greedy Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1760-3820","authenticated-orcid":false,"given":"Song","family":"Cao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7365-9576","authenticated-orcid":false,"given":"Taikun","family":"Zhu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3720-5117","authenticated-orcid":false,"given":"Kai","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Osman, M.S., Abo-Sinna, M.A., Mousa, A.A.: An effective genetic algorithm approach to multiobjective resource allocation problems (MORAPs). Appl. Math. Comput. 163(2), 755\u2013768 (2005)","DOI":"10.1016\/j.amc.2003.10.057"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bitran, G.R., Tirupati, D.: Tradeoff curves, targeting and balancing in manufacturing queueing networks. Oper. Res. 37(4), 547\u2013564 (1989)","DOI":"10.1287\/opre.37.4.547"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/0377-2217(94)90283-6","volume":"76","author":"GR Bitran","year":"1994","unstructured":"Bitran, G.R., Sarkar, D.: Targeting problems in manufacturing queueing networks-an iterative scheme and convergence. Eur. J. Oper. Res. 76(3), 501\u2013510 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Rajkumar, R., Lee, C., Lehoczky, J., Siewiorek, D.: A resource allocation model for QoS management. In: Proceedings Real-Time Systems Symposium, pp. 298\u2013307. IEEE (1997)","DOI":"10.1109\/REAL.1997.641291"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bretthauer, K.M., Ross, A., Shetty, B.: Nonlinear integer programming for optimal allocation in stratified sampling. Eur. J. Oper. Res. 116(3), 667\u2013680 (1999)","DOI":"10.1016\/S0377-2217(98)00180-5"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/978-1-4613-0303-9_14","volume-title":"Handbook of Combinatorial Optimization","author":"N Katoh","year":"1999","unstructured":"Katoh, N., Ibaraki, T.: Resource allocation problems. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 905\u20131006. Springer US, Boston, MA (1999). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_14"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1287\/mnsc.13.3.210","volume":"13","author":"B Fox","year":"1966","unstructured":"Fox, B.: Discrete optimization via marginal analysis. Manage. Sci. 13(3), 210\u2013216 (1966). https:\/\/doi.org\/10.1287\/mnsc.13.3.210","journal-title":"Manage. Sci."},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1057\/jors.1974.107","volume":"25","author":"W Shih","year":"1974","unstructured":"Shih, W.: A new application of incremental analysis in resource allocations. J. Oper. Res. Soc. 25(4), 587\u2013597 (1974)","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"9_CR9","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1287\/opre.34.6.909","volume":"34","author":"A Federgruen","year":"1986","unstructured":"Federgruen, A., Groenevelt, H.: The greedy procedure for resource allocation problems: necessary and sufficient conditions for optimality. Oper. Res. 34(6), 909\u2013918 (1986)","journal-title":"Oper. Res."},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF02680565","volume":"83","author":"K Murota","year":"1998","unstructured":"Murota, K.: Discrete convex analysis. Math. Program. 83, 313\u2013371 (1998)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"9_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(97)00140-6","volume":"84","author":"A Shioura","year":"1998","unstructured":"Shioura, A.: Minimization of an M-convex function. Discret. Appl. Math. 84(1\u20133), 215\u2013220 (1998)","journal-title":"Discret. Appl. Math."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Bretthauer, K.M., Shetty, B.: The nonlinear resource allocation problem. Oper. Res. 43(4), 670\u2013683 (1995)","DOI":"10.1287\/opre.43.4.670"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K., Sivan, B., Wilkens, C.A.: Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In: Proceedings of the 12th ACM Conference on Electronic Commerce, pp. 29\u201338 (2011)","DOI":"10.1145\/1993574.1993581"},{"issue":"11","key":"9_CR14","doi-asserted-by":"publisher","first-page":"3116","DOI":"10.1109\/TCYB.2017.2759141","volume":"48","author":"Z Deng","year":"2017","unstructured":"Deng, Z., Liang, S., Hong, Y.: Distributed continuous-time algorithms for resource allocation problems over weight-balanced digraphs. IEEE Trans. Cybern. 48(11), 3116\u20133125 (2017)","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3293465","volume":"15","author":"M Cygan","year":"2019","unstructured":"Cygan, M., Mucha, M., W\u0119grzycki, K., W\u0142odarczyk, M.: On problems equivalent to (min,+)-convolution. ACM Trans. Algorithms (TALG) 15(1), 1\u201325 (2019)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Bremner, D., et al.: Necklaces, convolutions, and x+ y. In: Azar, Y., Erlebach, T. (eds) Algorithms\u2013ESA 2006: 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings 14, pp. 160\u2013171. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841036_17","DOI":"10.1007\/11841036_17"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Bussieck, M., Hassler, H., Woeginger, G.J., Zimmermann, U.T.: Fast algorithms for the maximum convolution problem. Oper. Res. Lett. 15(3), 133\u2013141 (1994)","DOI":"10.1016\/0167-6377(94)90048-5"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Lewenstein, M.: Clustered integer 3SUM via additive combinatorics. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 31\u201340 (2015)","DOI":"10.1145\/2746539.2746568"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Chi, S., Duan, R., Xie, T., Zhang, T.: Faster min-plus product for monotone instances. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1529\u20131542 (2022)","DOI":"10.1145\/3519935.3520057"},{"key":"9_CR20","unstructured":"Bringmann, K., Cassis, A.: Faster 0-1-knapsack via near-convex min-plus-convolution. arXiv preprint arXiv:2305.01593 (2023)"},{"issue":"1","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1999.1034","volume":"33","author":"D Pisinger","year":"1999","unstructured":"Pisinger, D.: Linear time algorithms for knapsack problems with bounded weights. J. Algorithms 33(1), 1\u201314 (1999)","journal-title":"J. Algorithms"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Bringmann, K.: Knapsack with small items in near-quadratic time. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pp. 259\u2013270 (2024)","DOI":"10.1145\/3618260.3649719"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Cao, S., Zhu, T., Jin, K.: Discrete effort distribution via regrettable greedy algorithm. arXiv preprint arXiv:2503.11107 (2025)","DOI":"10.1007\/978-981-95-0215-8_9"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0215-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T09:33:46Z","timestamp":1757324026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0215-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9789819502141","9789819502158"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0215-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}