{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:24Z","timestamp":1750308564519,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":3,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1047916"],"award-info":[{"award-number":["1047916"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1145\/2792745.2792751","type":"proceedings-article","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T14:35:23Z","timestamp":1438007723000},"page":"1-2","source":"Crossref","is-referenced-by-count":4,"title":["A scalable computational approach to political redistricting optimization"],"prefix":"10.1145","author":[{"given":"Yan Y.","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wendy K. Tam","family":"Cho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaowen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/2792745.2792751-1","unstructured":"M. R. Garey and D. S. Johnson, \"Computers and Intractability; A Guide to the Theory of NP-Completeness\": W. H. Freeman and Co., 1990."},{"key":"key-10.1145\/2792745.2792751-2","doi-asserted-by":"crossref","unstructured":"W. K.T. Cho and J. G. Gimpel, \"Geographic Information Systems and the Spatial Dimensions of American Politics,\"Annual Review of Political Science, 15: 443--460, 2012.","DOI":"10.1146\/annurev-polisci-031710-112215"},{"key":"key-10.1145\/2792745.2792751-3","doi-asserted-by":"crossref","unstructured":"Y. Y. Liu and S. Wang, \"A Scalable Parallel Genetic Algorithm for the Generalized Assignment Problem.\"Parallel Computing, http:\/\/dx.doi.org\/10.1016\/j.parco.2014.04.008.","DOI":"10.1016\/j.parco.2014.04.008"}],"event":{"number":"2015","sponsor":["CORSA, CORSA Technology","CASC, The Coalition for Academic Scientific Computation","RENCI, Renaissance Computing Institute","HPCWire","SGI","San Diego Super Computing Ctr","Cray","Indiana University","Intel"],"acronym":"XSEDE '15","name":"the 2015 XSEDE Conference","start":{"date-parts":[[2015,7,26]]},"theme":"Scientific Advancements Enabled by Enhanced Cyberinfrastructure","location":"St. Louis, Missouri","end":{"date-parts":[[2015,7,30]]}},"container-title":["Proceedings of the 2015 XSEDE Conference on Scientific Advancements Enabled by Enhanced Cyberinfrastructure - XSEDE '15"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2792745.2792751","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2792751&ftid=1608574&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:13Z","timestamp":1750273453000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2792745.2792751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":3,"URL":"https:\/\/doi.org\/10.1145\/2792745.2792751","relation":{},"subject":[],"published":{"date-parts":[[2015]]}}}