{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:42:11Z","timestamp":1746438131790,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/icumt.2014.7002169","type":"proceedings-article","created":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T20:07:34Z","timestamp":1421179654000},"page":"602-606","source":"Crossref","is-referenced-by-count":4,"title":["Fast genetic algorithm with greedy heuristic for p-median and k-means problems"],"prefix":"10.1109","author":[{"given":"Lev A.","family":"Kazakovtsev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aljona A.","family":"Stupina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"124","article-title":"Parallelny algoritm dlya p-mediannoy zadachi (Parallel Algorithm for the p-Median Problem)","volume":"52","author":"kazakovtsev","year":"2013","journal-title":"Control Systems and Information Technologies"},{"key":"ref11","first-page":"5","article-title":"The Weber problem: History and perspectives","volume":"1","author":"wesolowsky","year":"1982","journal-title":"Location Science"},{"key":"ref12","first-page":"239","article-title":"Adaptation of the Probability Changing Method for Weber Problem with an Arbitrary Metric","volume":"27","author":"kazakovtsev","year":"2012","journal-title":"Facta Universitatis (Niš) Ser Math Inform"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/EMS.2012.52"},{"key":"ref14","first-page":"175","article-title":"Single-facility Weber Location Problem Based on the Lift Metric","volume":"27","author":"stanimirovic","year":"2012","journal-title":"Facta Universitatis series Mathematics and Informatics"},{"key":"ref15","first-page":"487","article-title":"Chapter 8 \/ Introduction to Data Mining","author":"tan","year":"2006","journal-title":"Cluster Analysis Basic Concepts and Algorithms"},{"key":"ref16","first-page":"281","article-title":"Some Methods of Classification and Analysis of Multivariate Observations","volume":"1","author":"macqueen","year":"1967","journal-title":"Proceedings of the 5th Berkley Symposium on Mathematical Statistics and Probability"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.3.331"},{"key":"ref18","article-title":"Uber den Standort der Industrien","author":"weber","year":"1922","journal-title":"Teil Reine Theorie Des Standortes"},{"key":"ref19","first-page":"335","article-title":"Sur le point sur lequel la somme des distances de n points donnes est minimum","volume":"43","author":"weiszfeld","year":"1937","journal-title":"Tohoku Mathematical Journal"},{"key":"ref4","first-page":"137","article-title":"On optimal algorithms of optimization of functionals with Boolean variables","author":"antamoshkin","year":"1983","journal-title":"Trans Ninth Prague Conference on Inform Theory Statist Dec Functions Random Processes Academia"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0700-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02027381"},{"journal-title":"Optimization of the functions with boolean variables","year":"1987","author":"antamoshkin","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026130003508"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56082-8_6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0137041"},{"key":"ref9","first-page":"267","article-title":"Random Search Algorithm for the p-Median Problem","volume":"37","author":"antamoshkin","year":"2013","journal-title":"Informatica (Ljubljana)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"ref20","article-title":"The Fortified Weiszfeld Algorithm for Solving the Weber Problem","author":"drezner","year":"2013","journal-title":"IMA Journal of Management Mathematics"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2133803.2184450"},{"key":"ref21","first-page":"439","article-title":"Sublinear time approximate clustering","author":"mishra","year":"2001","journal-title":"12th SODA"},{"key":"ref24","first-page":"1027","article-title":"k-Means++: The Advantages of Careful Seeding","author":"arthur","year":"2007","journal-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11067-008-9084-5"},{"journal-title":"UCI Machine Learning Repository","year":"0","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.03.003"}],"event":{"name":"2014 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","start":{"date-parts":[[2014,10,6]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2014,10,8]]}},"container-title":["2014 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6992915\/7002065\/07002169.pdf?arnumber=7002169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T05:24:42Z","timestamp":1490333082000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7002169\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/icumt.2014.7002169","relation":{},"subject":[],"published":{"date-parts":[[2014,10]]}}}