{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:25:09Z","timestamp":1740108309133,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,10,20]],"date-time":"2018-10-20T00:00:00Z","timestamp":1539993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s00607-018-0670-1","type":"journal-article","created":{"date-parts":[[2018,10,20]],"date-time":"2018-10-20T10:15:03Z","timestamp":1540030503000},"page":"237-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Crowdsourcing planar facility location allocation problems"],"prefix":"10.1007","volume":"101","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2861-7745","authenticated-orcid":false,"given":"Mohammad","family":"Allahbakhsh","sequence":"first","affiliation":[]},{"given":"Saeed","family":"Arbabi","sequence":"additional","affiliation":[]},{"given":"Mohammadreza","family":"Galavii","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Daniel","sequence":"additional","affiliation":[]},{"given":"Boualem","family":"Benatallah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"issue":"2","key":"670_CR1","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/MIC.2013.20","volume":"17","author":"M Allahbakhsh","year":"2013","unstructured":"Allahbakhsh M, Benatallah B, Ignjatovic A, Motahari-Nezhad HR, Bertino E, Dustdar S (2013) Quality control in crowdsourcing systems: issues and directions. IEEE Internet Comput 17(2):76\u201381","journal-title":"IEEE Internet Comput"},{"key":"670_CR2","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-319-76587-7_8","volume-title":"Service research and innovation","author":"M Allahbakhsh","year":"2018","unstructured":"Allahbakhsh M, Amintoosi H, Kanhere SS (2018) A game-theoretic approach to quality improvement in crowdsourcing tasks. In: Beheshti A, Hashmi M, Dong H, Zhang WE (eds) Service research and innovation. Springer, Cham, pp 116\u2013130"},{"issue":"3","key":"670_CR3","first-page":"267","volume":"37","author":"N Antamoshkin Alexander","year":"2013","unstructured":"Antamoshkin Alexander N, Kazakovtsev Lev A (2013) Random search algorithm for the p-median problem. Informatica 37(3):267\u2013278","journal-title":"Informatica"},{"key":"670_CR4","unstructured":"Archak Nikolay, Sundararajan Arun (2009) Optimal design of crowdsourcing contests. In: ICIS 2009 proceedings, p 200"},{"issue":"1","key":"670_CR5","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.cor.2012.07.012","volume":"40","author":"J Brimberg","year":"2013","unstructured":"Brimberg J, Drezner Z (2013) A new heuristic for solving the p-median problem in the plane. Comput Oper Res 40(1):427\u2013437","journal-title":"Comput Oper Res"},{"issue":"3","key":"670_CR6","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","volume":"48","author":"J Brimberg","year":"2000","unstructured":"Brimberg J, Hansen P, Mladenovi\u0107 N, Taillard ED (2000) Improvements and comparison of heuristics for solving the uncapacitated multisource weber problem. Oper Res 48(3):444\u2013460","journal-title":"Oper Res"},{"issue":"1","key":"670_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0166-218X(00)00177-3","volume":"105","author":"RE Burkard","year":"2000","unstructured":"Burkard RE, \u00c7ela E, Dollani H (2000) 2-medians in trees with pos\/neg weights. Discrete Appl Math 105(1):51\u201371","journal-title":"Discrete Appl Math"},{"key":"670_CR8","unstructured":"Cappanera Paola (1999) A survey on obnoxious facility location problems"},{"issue":"3","key":"670_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1287\/opre.11.3.331","volume":"11","author":"L Cooper","year":"1963","unstructured":"Cooper L (1963) Location-allocation problems. Oper Res 11(3):331\u2013343","journal-title":"Oper Res"},{"issue":"1","key":"670_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1137\/1006005","volume":"6","author":"L Cooper","year":"1964","unstructured":"Cooper L (1964) Heuristic methods for location-allocation problems. SIAM Rev 6(1):37\u201353","journal-title":"SIAM Rev"},{"issue":"7307","key":"670_CR11","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1038\/nature09304","volume":"466","author":"S Cooper","year":"2010","unstructured":"Cooper S, Khatib F, Treuille A, Barbero J, Lee J, Beenen M, Leaver-Fay A, Baker D, Popovi\u0107 Z et al (2010) Predicting protein structures with a multiplayer online game. Nature 466(7307):756\u2013760","journal-title":"Nature"},{"issue":"1","key":"670_CR12","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/3148148","volume":"51","author":"F Daniel","year":"2018","unstructured":"Daniel F, Kucherbaev P, Cappiello C, Benatallah B, Allahbakhsh M (2018) Quality control in crowdsourcing: a survey of quality attributes, assessment techniques, and assurance actions. ACM Comput Surv 51(1):7:1\u20137:40","journal-title":"ACM Comput Surv"},{"key":"670_CR13","first-page":"21","volume-title":"The p-median problem","author":"MS Daskin","year":"2015","unstructured":"Daskin MS, Maass KL (2015) The p-median problem. Springer, Cham, pp 21\u201345"},{"key":"670_CR14","doi-asserted-by":"crossref","unstructured":"DiPalantino D, Vojnovic M (2009) Crowdsourcing and all-pay auctions. In: Proceedings of the 10th ACM conference on electronic commerce, ACM, pp 119\u2013128","DOI":"10.1145\/1566374.1566392"},{"issue":"4","key":"670_CR15","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1924421.1924442","volume":"54","author":"A Doan","year":"2011","unstructured":"Doan A, Ramakrishnan R, Halevy AY (2011) Crowdsourcing systems on the world-wide web. Commun ACM 54(4):86\u201396","journal-title":"Commun ACM"},{"key":"670_CR16","doi-asserted-by":"crossref","unstructured":"Dow S, Kulkarni A, Klemmer S, Hartmann B (2012) Shepherding the crowd yields better work. In: Proceedings of the ACM 2012 conference on computer supported cooperative work, ACM, pp 1013\u20131022","DOI":"10.1145\/2145204.2145355"},{"key":"670_CR17","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.cor.2014.05.010","volume":"62","author":"Z Drezner","year":"2015","unstructured":"Drezner Z, Brimberg J, Mladenovi\u0107 N, Salhi S (2015) New heuristic algorithms for solving the planar p-median problem. Comput Oper Res 62:296\u2013304","journal-title":"Comput Oper Res"},{"key":"670_CR18","volume-title":"Facility location: applications and theory","author":"Z Drezner","year":"2001","unstructured":"Drezner Z, Hamacher HW (2001) Facility location: applications and theory. Springer, Berlin"},{"key":"670_CR19","doi-asserted-by":"crossref","unstructured":"Feyisetan O, Simperl E, Van Kleek M, Shadbolt N (2015) Improving paid microtasks through gamification and adaptive furtherance incentives. In: Proceedings of the 24th international conference on world wide web, ACM, pp 333\u2013343","DOI":"10.1145\/2736277.2741639"},{"issue":"2","key":"670_CR20","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1109\/COMST.2014.2387836","volume":"17","author":"H Gao","year":"2015","unstructured":"Gao H, Liu CH, Wang W, Zhao J, Song Z, Su X, Crowcroft J, Leung KK (2015) A survey of incentive mechanisms for participatory sensing. IEEE Commun Surv Tutor 17(2):918\u2013943 Secondquarter","journal-title":"IEEE Commun Surv Tutor"},{"key":"670_CR21","volume-title":"Network models and optimization: multiobjective genetic algorithm approach","author":"M Gen","year":"2008","unstructured":"Gen M, Cheng R, Lin L (2008) Network models and optimization: multiobjective genetic algorithm approach. Springer, Berlin"},{"key":"670_CR22","doi-asserted-by":"crossref","unstructured":"Goncalves J, Hosio S, Ferreira D, Kostakos V (2014) Game of words: tagging places through crowdsourcing on public displays. In: Proceedings of the 2014 conference on designing interactive systems, DIS \u201914, New York, NY, USA, ACM, pp 705\u2013714","DOI":"10.1145\/2598510.2598514"},{"key":"670_CR23","doi-asserted-by":"crossref","unstructured":"Guo S, Parameswaran A, Garcia-Molina H (2012) So who won?: dynamic max discovery with the crowd. In: Proceedings of the 2012 ACM SIGMOD international conference on management of data, SIGMOD \u201912, New York, NY, USA, ACM, pp 385\u2013396","DOI":"10.1145\/2213836.2213880"},{"issue":"3","key":"670_CR24","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12(3):450\u2013459","journal-title":"Oper Res"},{"issue":"3","key":"670_CR25","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"SL Hakimi","year":"1965","unstructured":"Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13(3):462\u2013475","journal-title":"Oper Res"},{"key":"670_CR26","doi-asserted-by":"crossref","unstructured":"Hamari J, Koivisto J, Sarsa H (2014) Does gamification work? A literature review of empirical studies on gamification. In: 2014 47th Hawaii international conference on system sciences (HICSS), IEEE, pp 3025\u20133034","DOI":"10.1109\/HICSS.2014.377"},{"key":"670_CR27","doi-asserted-by":"crossref","unstructured":"Huotari K, Hamari J (2012) Defining gamification: a service marketing perspective. In: Proceeding of the 16th international academic MindTrek conference, ACM, pp 17\u201322","DOI":"10.1145\/2393132.2393137"},{"issue":"6","key":"670_CR28","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(01)00021-1","volume":"29","author":"JH Jaramillo","year":"2002","unstructured":"Jaramillo JH, Bhadury J, Batta R (2002) On the use of genetic algorithms to solve location problems. Comput Oper Res 29(6):761\u2013779 Location Analysis","journal-title":"Comput Oper Res"},{"issue":"2","key":"670_CR29","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.cie.2006.12.007","volume":"52","author":"H Jia","year":"2007","unstructured":"Jia H, Ordonez F, Dessouky MM (2007) Solution approaches for facility location of medical supplies for large-scale emergencies. Comput Ind Eng 52(2):257\u2013276","journal-title":"Comput Ind Eng"},{"issue":"3","key":"670_CR30","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. i: the p-centers. SIAM J Appl Math 37(3):513\u2013538","journal-title":"SIAM J Appl Math"},{"issue":"3","key":"670_CR31","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. ii: the p-medians. SIAM J Appl Math 37(3):539\u2013560","journal-title":"SIAM J Appl Math"},{"key":"670_CR32","doi-asserted-by":"crossref","unstructured":"Kittur A, Smus B, Khamkar S, Kraut RE (2011) Crowdforge: crowdsourcing complex work. In: Proceedings of the 24th annual ACM symposium on User interface software and technology, ACM, pp 43\u201352","DOI":"10.1145\/2047196.2047202"},{"key":"670_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-319-13111-5","volume-title":"Introduction to location science","author":"G Laporte","year":"2015","unstructured":"Laporte G, Nickel S, da Gama FS (2015) Introduction to location science. Springer, Cham, pp 1\u201318"},{"key":"670_CR34","doi-asserted-by":"crossref","unstructured":"Little G, Chilton LB, Goldman M, Miller RC (2010) Turkit: human computation algorithms on mechanical turk. In: Proceedings of the 23nd annual ACM symposium on User interface software and technology, ACM, pp 57\u201366","DOI":"10.1145\/1866029.1866040"},{"key":"670_CR35","doi-asserted-by":"crossref","unstructured":"Luo T, Kanhere SS, Das SK, Tan H-P (2014) Optimal prizes for all-pay contests in heterogeneous crowdsourcing. In: 2014 IEEE 11th international conference on mobile ad hoc and sensor systems (MASS), IEEE, pp 136\u2013144","DOI":"10.1109\/MASS.2014.66"},{"key":"670_CR36","first-page":"55","volume":"1","author":"PB Mirchandani","year":"1990","unstructured":"Mirchandani PB (1990) The p-median problem and generalizations. Discrete Locat Theory 1:55\u2013117","journal-title":"Discrete Locat Theory"},{"key":"670_CR37","doi-asserted-by":"crossref","unstructured":"Morschheuser B, Hamari J, Koivisto J (2016) Gamification in crowdsourcing: a review. In: 2016 49th Hawaii international conference on system sciences (HICSS), IEEE, pp 4375\u20134384","DOI":"10.1109\/HICSS.2016.543"},{"key":"670_CR38","doi-asserted-by":"crossref","unstructured":"Pfeiffer III JJ, Moreno S, La\u00a0Fond T, Neville J, Gallagher B (2014) Attributed graph models: modeling network structure with correlated attributes. In: Proceedings of the 23rd international conference on World Wide Web, WWW \u201914, New York, NY, USA, ACM, pp 831\u2013842","DOI":"10.1145\/2566486.2567993"},{"issue":"3","key":"670_CR39","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.20128","volume":"48","author":"J Reese","year":"2006","unstructured":"Reese J (2006) Solution methods for the p-median problem: an annotated bibliography. Networks 48(3):125\u2013142","journal-title":"Networks"},{"key":"670_CR40","unstructured":"Rogstadius J, Kostakos V, Kittur A, Smus B, Laredo J, Vukovic M (2011) An assessment of intrinsic and extrinsic motivation on task performance in crowdsourcing markets. In: ICWSM"},{"key":"670_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45557-0","volume-title":"Gamification","author":"S Stieglitz","year":"2017","unstructured":"Stieglitz S, Lattemann C, Robra-Bissantz S, Zarnekow R, Brockmann T (2017) Gamification. Springer, Berlin"},{"key":"670_CR42","doi-asserted-by":"crossref","unstructured":"Venetis P, Garcia-Molina H, Huang K, Polyzotis N (2012) Max algorithms in crowdsourcing environments. In: Proceedings of the 21st international conference on World Wide Web, WWW \u201912, New York, NY, USA, ACM, pp 989\u2013998","DOI":"10.1145\/2187836.2187969"},{"key":"670_CR43","first-page":"355","volume":"43","author":"E Weiszfeld","year":"1937","unstructured":"Weiszfeld E (1937) Sur le point pour lequel la somme des distances de n points donn\u00e9s est minimum. Tohoku Math J First Ser 43:355\u2013386","journal-title":"Tohoku Math J First Ser"},{"key":"670_CR44","doi-asserted-by":"crossref","unstructured":"Welinder P, Perona P (2010) Online crowdsourcing: rating annotators and obtaining cost-effective labels. In: 2010 IEEE computer society conference on computer vision and pattern recognition workshops (CVPRW), , IEEE, pp 25\u201332","DOI":"10.1109\/CVPRW.2010.5543189"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-018-0670-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0670-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0670-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T06:19:22Z","timestamp":1693981162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-018-0670-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,20]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["670"],"URL":"https:\/\/doi.org\/10.1007\/s00607-018-0670-1","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2018,10,20]]},"assertion":[{"value":"19 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}