{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:38:30Z","timestamp":1729665510933,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1109\/icinfa.2013.6720486","type":"proceedings-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T22:34:30Z","timestamp":1391207670000},"page":"1252-1257","source":"Crossref","is-referenced-by-count":3,"title":["Solving the market split problem using a distributed computation approach"],"prefix":"10.1109","author":[{"given":"Zhengtian","family":"Wu","sequence":"first","affiliation":[]},{"given":"Chuangyin","family":"Dang","sequence":"additional","affiliation":[]},{"given":"Changan","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701"},{"journal-title":"MPI A Message-Passing Interface Standard Version 2 2","year":"2009","key":"16"},{"journal-title":"Linear Programming and Extensions","year":"1998","author":"dantzig","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.1.53"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.886802"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"3"},{"key":"2","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/3-540-69346-7_22","article-title":"A class of hard small 0-1 programs","author":"cornuejols","year":"1998","journal-title":"Lecture Notes in Computer Science"},{"journal-title":"A Fixed-Point Iterative Approach to Integer Programming and Distributed Computation","year":"2011","author":"dang","key":"10"},{"journal-title":"Model Building in Mathematical Programming","year":"1978","author":"williams","key":"1"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1143-0"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013355015853"},{"key":"5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-69346-7_18","article-title":"Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables","author":"aardal","year":"1998","journal-title":"Lecture Notes in Computer Science"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48777-8_1"},{"key":"9","first-page":"55","article-title":"An increasing-mapping approach to integer programming based on lexicographic ordering and linear programming","author":"dang","year":"2010","journal-title":"The 9th International Symposium on Operations Research and its Applications (ISORA)"},{"key":"8","first-page":"599","article-title":"Numerical experiments with the lll-based hermite normal form algorithm for solving linear diophantine systems","volume":"7","author":"khorramizadeh","year":"2012","journal-title":"Int J Contemp Math Sci"}],"event":{"name":"2013 IEEE International Conference on Information and Automation (ICIA)","start":{"date-parts":[[2013,8,26]]},"location":"Yinchuan, China","end":{"date-parts":[[2013,8,28]]}},"container-title":["2013 IEEE International Conference on Information and Automation (ICIA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6709836\/6720259\/06720486.pdf?arnumber=6720486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T07:04:14Z","timestamp":1498115054000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6720486\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icinfa.2013.6720486","relation":{},"subject":[],"published":{"date-parts":[[2013,8]]}}}