{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T14:04:19Z","timestamp":1772633059431,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"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":["Inf Technol Manag"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10799-024-00432-3","type":"journal-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T03:02:33Z","timestamp":1719889353000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The bundled task assignment problem in mobile crowdsensing: a lagrangean relaxation-based solution approach"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9538-1245","authenticated-orcid":false,"given":"Ali","family":"Amiri","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"issue":"3","key":"432_CR1","doi-asserted-by":"publisher","first-page":"919","DOI":"10.25300\/MISQ\/2018\/14103","volume":"42","author":"J Mo","year":"2018","unstructured":"Mo J, Sarkar S, Menon S (2018) Know when to run: recommendations in crowdsourcing contests. MIS Q 42(3):919\u2013944","journal-title":"MIS Q"},{"issue":"6","key":"432_CR2","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1111\/isj.12397","volume":"32","author":"J Ye","year":"2022","unstructured":"Ye J, Jensen M (2022) Effects of introducing an online community in a crowdsourcing contest platform. Inf Syst J 32(6):1203\u20131230","journal-title":"Inf Syst J"},{"key":"432_CR3","doi-asserted-by":"crossref","unstructured":"To H, Fan L, Tran L, Shahabi C (2016) Real-time task assignment in hyperlocal spatial crowdsourcing under budget constraints. In: 2016 IEEE International Conference on Pervasive Computing and Communications, PerCom, p. 1\u20138","DOI":"10.1109\/PERCOM.2016.7456507"},{"key":"432_CR4","doi-asserted-by":"crossref","unstructured":"Xiong H, Zhang D, Chen G, Wang L, Gauthier V (2015, March) Crowdtasker: Maximizing coverage quality in piggyback crowdsensing under budget constraint. In: 2015 IEEE International Conference on Pervasive Computing and Communications, PerCom, p. 55\u201362","DOI":"10.1109\/PERCOM.2015.7146509"},{"issue":"2","key":"432_CR5","doi-asserted-by":"publisher","first-page":"1886","DOI":"10.1109\/JSYST.2016.2600582","volume":"12","author":"H Zhang","year":"2016","unstructured":"Zhang H, Liu J, Kato N (2016) Threshold tuning-based wearable sensor fault detection for reliable medical monitoring using bayesian network model. IEEE Syst J 12(2):1886\u20131896","journal-title":"IEEE Syst J"},{"issue":"5","key":"432_CR6","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1109\/TC.2016.2620469","volume":"66","author":"TG Rodrigues","year":"2016","unstructured":"Rodrigues TG, Suto K, Nishiyama H, Kato N (2016) Hybrid method for minimizing service delay in edge cloud computing through VM migration and transmission power control. IEEE Trans Comput 66(5):810\u2013819","journal-title":"IEEE Trans Comput"},{"issue":"9","key":"432_CR7","doi-asserted-by":"publisher","first-page":"7698","DOI":"10.1109\/TVT.2015.2490679","volume":"65","author":"M Zhang","year":"2015","unstructured":"Zhang M, Yang P, Tian C, Tang S, Gao X, Wang B, Xiao F (2015) Quality-aware sensing coverage in budget-constrained mobile crowdsensing networks. IEEE Trans Veh Technol 65(9):7698\u20137707","journal-title":"IEEE Trans Veh Technol"},{"key":"432_CR8","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1007\/s11276-014-0687-0","volume":"20","author":"D Zhao","year":"2014","unstructured":"Zhao D, Ma H, Liu L (2014) Energy-efficient opportunistic coverage for people-centric urban sensing. Wireless Netw 20:1461\u20131476","journal-title":"Wireless Netw"},{"key":"432_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s11704-017-7024-6","volume":"12","author":"L Wang","year":"2018","unstructured":"Wang L, Yu Z, Guo B, Yi F, Xiong F (2018) Mobile crowd sensing task optimal allocation: a mobility pattern matching perspective. Front Comp Sci 12:231\u2013244","journal-title":"Front Comp Sci"},{"key":"432_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.future.2018.05.005","volume":"87","author":"Y Liu","year":"2018","unstructured":"Liu Y, Du F, Sun J, Jiang Y, He J, Zhu T, Sun C (2018) A crowdsourcing-based topic model for service matchmaking in internet of things. Futur Gener Comput Syst 87:186\u2013197","journal-title":"Futur Gener Comput Syst"},{"issue":"1","key":"432_CR11","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1109\/JIOT.2018.2866973","volume":"6","author":"X Tao","year":"2018","unstructured":"Tao X, Song W (2018) Location-dependent task allocation for mobile crowdsensing with clustering effect. IEEE Internet Things J 6(1):1029\u20131045","journal-title":"IEEE Internet Things J"},{"issue":"8","key":"432_CR12","doi-asserted-by":"publisher","first-page":"2306","DOI":"10.1109\/TMC.2016.2616473","volume":"16","author":"M Xiao","year":"2016","unstructured":"Xiao M, Wu J, Huang L, Cheng R, Wang Y (2016) Online task assignment for crowdsensing in predictable mobile social networks. IEEE Trans Mobil Comput 16(8):2306\u20132320","journal-title":"IEEE Trans Mobil Comput"},{"issue":"7","key":"432_CR13","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1109\/TMC.2014.2357791","volume":"14","author":"H Xiong","year":"2014","unstructured":"Xiong H, Zhang D, Wang L, Chaouchi H (2014) EMC 3: energy-efficient data transfer in mobile crowdsensing under full coverage constraint. IEEE Trans Mob Comput 14(7):1355\u20131368","journal-title":"IEEE Trans Mob Comput"},{"key":"432_CR14","doi-asserted-by":"crossref","unstructured":"Hu H, Zheng Y, Bao Z, Li G, Feng J, Cheng R (2016) Crowdsourced POI labeling: Location-aware result inference and task assignment. In: 2016 IEEE 32nd International conference on data engineering, ICDE, p. 61\u201372","DOI":"10.1109\/ICDE.2016.7498229"},{"issue":"10","key":"432_CR15","doi-asserted-by":"publisher","first-page":"3410","DOI":"10.1109\/TKDE.2020.2965932","volume":"33","author":"X Gao","year":"2020","unstructured":"Gao X, Huang H, Liu C, Wu F, Chen G (2020) Quality inference-based task assignment in mobile crowdsensing. IEEE Trans Knowl Data Eng 33(10):3410\u20133423","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"432_CR16","doi-asserted-by":"crossref","unstructured":"Wu S, Gao X, Wu F, Chen G (2017, December) A constant-factor approximation for bounded task allocation problem in crowdsourcing. In: GLOBECOM 2017\u20132017 IEEE Global Communications Conference, p. 1\u20136","DOI":"10.1109\/GLOCOM.2017.8254430"},{"key":"432_CR17","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.dss.2016.06.019","volume":"90","author":"C Miao","year":"2016","unstructured":"Miao C, Yu H, Shen Z, Leung C (2016) Balancing quality and budget considerations in mobile crowdsourcing. Decis Support Syst 90:56\u201364","journal-title":"Decis Support Syst"},{"key":"432_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2022.113869","volume":"164","author":"Z Wu","year":"2023","unstructured":"Wu Z, Peng L, Xiang C (2023) Assuring quality and waiting time in real-time spatial crowdsourcing. Decis Support Syst 164:113869","journal-title":"Decis Support Syst"},{"key":"432_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2020.113404","volume":"139","author":"A Moayedikia","year":"2020","unstructured":"Moayedikia A, Ghaderi H, Yeoh W (2020) Optimizing microtask assignment on crowdsourcing platforms using markov chain monte carlo. Decis Support Syst 139:113404","journal-title":"Decis Support Syst"},{"key":"432_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2020.113449","volume":"141","author":"YM Li","year":"2021","unstructured":"Li YM, Hsieh CY, Lin LF, Wei CH (2021) A social mechanism for task-oriented crowdsourcing recommendations. Decis Support Syst 141:113449","journal-title":"Decis Support Syst"},{"issue":"6","key":"432_CR21","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held M, Karp RM (1970) The traveling-salesman problem and minimum spanning trees. Oper Res 18(6):1138\u20131162","journal-title":"Oper Res"},{"issue":"1","key":"432_CR22","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held M, Karp RM (1971) The traveling-salesman problem and minimum spanning trees: Part II. Math Program 1(1):6\u201325","journal-title":"Math Program"},{"issue":"1","key":"432_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher ML (1981) The lagrangian relaxation method for solving integer programming problems. Manage Sci 27(1):1\u201318","journal-title":"Manage Sci"},{"issue":"5","key":"432_CR24","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion AM, Graves GW (1974) Multicommodity distribution system design by Benders decomposition. Manage Sci 20(5):822\u2013844","journal-title":"Manage Sci"},{"key":"432_CR25","unstructured":"Nemhauser GL, Wolsey L (1998) An Integer and Combinatorial Optimization. Wiley-Interscience series in discrete mathematics and optimization."},{"issue":"5","key":"432_CR26","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas E, Zemel E (1980) An algorithm for large zero-one knapsack problems. Oper Res 28(5):1130\u20131154","journal-title":"Oper Res"},{"issue":"2","key":"432_CR27","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","volume":"123","author":"S Martello","year":"2000","unstructured":"Martello S, Pisinger D, Toth P (2000) New trends in exact algorithms for the 0\u20131 knapsack problem. Eur J Oper Res 123(2):325\u2013332","journal-title":"Eur J Oper Res"},{"issue":"5","key":"432_CR28","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D Pisinger","year":"1997","unstructured":"Pisinger D (1997) A minimal algorithm for the 0\u20131 knapsack problem. Oper Res 45(5):758\u2013767","journal-title":"Oper Res"},{"key":"432_CR29","unstructured":"IBM ILOG CPLEX Optimization Studio CPLEX User\u2019s Manual, version 12 (IBM Corp., Armonk, NY), 2020."}],"container-title":["Information Technology and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10799-024-00432-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10799-024-00432-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10799-024-00432-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T07:13:15Z","timestamp":1772608395000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10799-024-00432-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,2]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["432"],"URL":"https:\/\/doi.org\/10.1007\/s10799-024-00432-3","relation":{},"ISSN":["1385-951X","1573-7667"],"issn-type":[{"value":"1385-951X","type":"print"},{"value":"1573-7667","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,2]]},"assertion":[{"value":"21 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no relevant financial or non-financial interests to disclose. The author is a member of the Editorial Board of ITM.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}