{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:18:54Z","timestamp":1725815934454},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_23","type":"book-chapter","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T01:23:50Z","timestamp":1422408230000},"page":"238-249","source":"Crossref","is-referenced-by-count":1,"title":["Auction\/Belief Propagation Algorithms for Constrained Assignment Problem"],"prefix":"10.1007","author":[{"given":"Mindi","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Wei","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yannis","family":"Pavlidis","sequence":"additional","affiliation":[]},{"given":"Shen","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Andersen, D., Dahl, J., Vandenberghe, L.: CVXOPT: Python software for convex optimization, \n                    \n                      http:\/\/cvxopt.org\/index.html"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1137\/090753115","volume":"25","author":"M. Bayati","year":"2011","unstructured":"Bayati, M., Borgs, C., Chayes, J., Zecchina, R.: Belief propagation for weighted b-matchings on arbitrary graphs and its relation to linear programs with integer solutions. SIAM J. Discrete Math.\u00a025, 989\u20131011 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1109\/TIT.2007.915695","volume":"54","author":"M. Bayati","year":"2008","unstructured":"Bayati, M., Shah, D., Sharma, M.: Max-product for maximum weight matching: convergence, correctness, and LP duality. IEEE Trans. Info. Theory\u00a054, 1241\u20131251 (2008)","journal-title":"IEEE Trans. Info. Theory"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02216923","volume":"20","author":"D.P. Bertsekas","year":"1989","unstructured":"Bertsekas, D.P.: The auction algorithm for the transportation problem. Annals of Operations Research\u00a020(1), 67\u201396 (1989)","journal-title":"Annals of Operations Research"},{"key":"23_CR5","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice-Hall (1989)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Blum, M., Floyd, B., Pratt, V., Rivest, R., Tarjan, B.: Linear time bounds for median computations. In: STOC, pp. 119\u2013124 (1972)","DOI":"10.1145\/800152.804904"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1287\/opre.1110.1025","volume":"60","author":"D. Gamarnik","year":"2012","unstructured":"Gamarnik, D., Shah, D., Wei, Y.: Belief propagation for min-cost network flow: Convergence and correctness. Operations Research\u00a060, 410\u2013428 (2012)","journal-title":"Operations Research"},{"key":"23_CR8","unstructured":"Kiraly, Z., Kovacs, P.: Efficient implementations of minimum-cost flow algorithms, \n                    \n                      http:\/\/arxiv.org\/abs\/1207.6381"},{"key":"23_CR9","unstructured":"Kiraly, Z., Kovacs, P.: LEMON graph library (COIN OR), \n                    \n                      http:\/\/lemon.cs.elte.hu\/trac\/lemon"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Sanghavi, S.: Equivalence of LP relaxation and max-product for weighted matching in general graphs. In: IEEE Info. Theory Workshop, pp. 242\u2013247 (2007)","DOI":"10.1109\/ITW.2007.4313081"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-662-44917-2_35","volume-title":"Network and Parallel Computing","author":"M. Yuan","year":"2014","unstructured":"Yuan, M., Jiang, C., Li, S., Shen, W., Pavlidis, Y., Li, J.: Message passing algorithm for the generalized assignment problem. In: Hsu, C.-H., Shi, X., Salapura, V. (eds.) NPC 2014. LNCS, vol.\u00a08707, pp. 423\u2013434. Springer, Heidelberg (2014)"},{"key":"23_CR12","unstructured":"Yuan, M., Li, S., Shen, W., Pavlidis, Y.: Belief propagation for minimax weight matching. Tech. rep., University of Illinois (2013)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Zavlanos, M.M., Spesivtsev, L., Pappas, G.J.: A distributed auction algorithm for the assignment problem. In: Proceedings of the 47th IEEE Conference on Decision and Control, pp. 1212\u20131217 (2008)","DOI":"10.1109\/CDC.2008.4739098"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:14:02Z","timestamp":1559106842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}