{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:59:44Z","timestamp":1761487184618,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/cdc.2003.1272528","type":"proceedings-article","created":{"date-parts":[[2004,7,8]],"date-time":"2004-07-08T16:05:44Z","timestamp":1089302744000},"page":"13-18","source":"Crossref","is-referenced-by-count":24,"title":["Distributed algorithms for dynamic reassigment"],"prefix":"10.1109","volume":"1","author":[{"given":"D.A.","family":"Castanon","sequence":"first","affiliation":[]},{"given":"C.","family":"Wu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"319","article-title":"ParalleI Primal-Dual Methods for the Minimum Cost Network Flow Problem","volume":"2","author":"bertsekas","year":"1993","journal-title":"Computational Optimization and Applications"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.5.3.261"},{"key":"ref10","first-page":"370","article-title":"A Successive Shortest Path algorithm for the Assignment Problem","volume":"20","author":"engquist","year":"1982","journal-title":"INFOR"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0927-0507(05)80122-7","article-title":"Parallel Computing in Network Optimization","volume":"7","author":"bertsekas","year":"1995","journal-title":"Handbook of Operations Research"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2002.1184948"},{"journal-title":"Parallel and Distributed Computation Numerical Methods","year":"1989","author":"bertsekas","key":"ref5"},{"journal-title":"Efficient Graph Algorithms for Sequential and Parallel Computers","year":"1987","author":"goldberg","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/moor.15.3.430"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80062-6"},{"key":"ref9","article-title":"An Approximate Algorithm for a Weapon Target Assignment Stochastic Program","author":"murphey","year":"1999","journal-title":"Approximation and Complexity in Numerical Optimizatin Continuous and Discrete Problems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/115234.115349"}],"event":{"name":"42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)","acronym":"CDC-03","location":"Maui, Hawaii, USA"},"container-title":["42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8969\/28478\/01272528.pdf?arnumber=1272528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T13:51:14Z","timestamp":1585835474000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1272528\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/cdc.2003.1272528","relation":{},"subject":[]}}