{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T02:26:05Z","timestamp":1662517565589},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1007\/bf00247794","type":"journal-article","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T21:50:36Z","timestamp":1320789036000},"page":"251-272","source":"Crossref","is-referenced-by-count":3,"title":["A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Olof","family":"Damberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sverre","family":"Stor\u00f8y","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tor","family":"S\u00f8revik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF00247794_CR1","doi-asserted-by":"crossref","unstructured":"G. Amdahl. Validity of the single processor approach to achieving large scale computing capabilities. In AFIPS Conference proceedings, Washington D.C., 1967, Thompson Books.","DOI":"10.1145\/1465482.1465560"},{"key":"BF00247794_CR2","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1145\/115234.115349","volume":"38","author":"E. Balas","year":"1991","unstructured":"E. Balas, D. Miller, J. Pekny, and P. Toth. A parallel shortest path algorithm for the assignment problem. J. Assoc. Comput. Mach., 38:985\u20131004, 1991.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF00247794_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584319","volume":"13","author":"R. Barr","year":"1977","unstructured":"R. Barr, F. Glover, and D. Klingman. The alternating basis algorithm for the assignment problem. Math. Programming, 13:1\u201313, 1977.","journal-title":"Math. Programming"},{"key":"BF00247794_CR4","first-page":"223","volume-title":"Computers and Mathematical Programming","author":"R. Barr","year":"1978","unstructured":"R. Barr, F. Glover, and D. Klingman. A new alternating basis algorithm for semi-assignment networks. In W. White, editor, Computers and Mathematical Programming, pages 223\u2013232. National Bureau of Standards Special Publication, U.S. Government Printing Office, Washington D.C., 1978."},{"key":"BF00247794_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02186476","volume":"14","author":"D. P. Bertsekas","year":"1988","unstructured":"D. P. Bertsekas. The auction algorithm: A distributed relaxation method for the assignment problem. Ann. Oper. Res., 14:105\u2013123, 1988.","journal-title":"Ann. Oper. Res."},{"key":"BF00247794_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/inte.20.4.133","volume":"20","author":"D. P. Bertsekas","year":"1990","unstructured":"D. P. Bertsekas. The auction algorithm for assignment and other network flow problems: A tutorial. Interfaces, 20:133\u2013149, 1990.","journal-title":"Interfaces"},{"key":"BF00247794_CR7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02216923","volume":"20","author":"D. P. Bertsekas","year":"1989","unstructured":"D. P. Bertsekas and D. A. Casta\u00f1on. The auction algorithm for the transportation problem. Ann. Oper. Res., 20:67\u201396, 1989.","journal-title":"Ann. Oper. Res."},{"key":"BF00247794_CR8","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/S0167-8191(05)80062-6","volume":"17","author":"D. P. Bertsekas","year":"1991","unstructured":"D. P. Bertsekas and D. A. Casta\u00f1on. Parallel synchronous and asynchronous implementations of the auction algorithm. Parallel Comput., 17:707\u2013732, 1991.","journal-title":"Parallel Comput."},{"key":"BF00247794_CR9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1287\/ijoc.5.3.261","volume":"5","author":"D. P. Bertsekas","year":"1993","unstructured":"D. P. Bertsekas and D. A. Casta\u00f1on. Parallel asynchronous Hungarian methods for the assignment problem. ORSA J. Comput., 5:261\u2013274, 1993.","journal-title":"ORSA J. Comput."},{"key":"BF00247794_CR10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02288323","volume":"13","author":"G. Carpaneto","year":"1988","unstructured":"G. Carpaneto, S. Martello, and P. Toth. Algorithms and codes for the assignment problem. Ann. Oper. Res., 13:193\u2013223, 1988.","journal-title":"Ann. Oper. Res."},{"key":"BF00247794_CR11","series-title":"Final Report TR-457","volume-title":"Development of advanced WTA algorithms for parallel processing","author":"D. A. Casta\u00f1on","year":"1989","unstructured":"D. A. Casta\u00f1on. Development of advanced WTA algorithms for parallel processing. Final Report TR-457, ALPHATECH, Inc., 111 Middlesex Turnpike, Burlington, MA 01803, 1989."},{"key":"BF00247794_CR12","series-title":"Technical Report TP-1245","volume-title":"Performance of parallel assignments algorithms on different multiprocessor architectures","author":"D. A. Casta\u00f1on","year":"1989","unstructured":"D. A. Casta\u00f1on, B. Smith, and A. Wilson. Performance of parallel assignments algorithms on different multiprocessor architectures. Technical Report TP-1245, ALPHATECH, Inc., 111 Middlesex Turnpike, Burlington, MA 01803, 1989."},{"key":"BF00247794_CR13","unstructured":"P. Christy. Software to support massively parallel computing on the MasPar MP-1. In Proceedings of IEEE Compcon Spring 1990. IEEE, February 1990."},{"key":"BF00247794_CR14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580379","volume":"11","author":"W. Cunningham","year":"1976","unstructured":"W. Cunningham. A network simplex method. Math. Programming, 11:105\u2013116, 1976.","journal-title":"Math. Programming"},{"key":"BF00247794_CR15","doi-asserted-by":"crossref","unstructured":"O. Damberg and A. Migdalas. A data parallel space dilation algorithm for the concentrator location problem. In P. M. Pardalos et. al., editors, Parallel Processing of Discrete Optimization Problems, volume 22 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 57\u201380. AMS, 1995.","DOI":"10.1090\/dimacs\/022\/04"},{"key":"BF00247794_CR16","series-title":"Report LiTH-MAT-R-1994-15","volume-title":"A data parallel primal-dual algorithm for the dense linear many-to-one assignment problem","author":"O. Damberg","year":"1994","unstructured":"O. Damberg, S. Stor\u00f8y, and T. S\u00f8revik. A data parallel primal-dual algorithm for the dense linear many-to-one assignment problem. Report LiTH-MAT-R-1994\u201315. Department of Mathematics, Link\u00f6ping Institute of Technology, S-581 83 Link\u00f6ping, Sweden, 1994."},{"key":"BF00247794_CR17","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/jpdc.1993.1107","volume":"19","author":"A. Gupta","year":"1993","unstructured":"A. Gupta and V. Kumar. Performance properties of large scale parallel systems. J. Parallel Distrib. Systems, 19:234\u2013244, 1993.","journal-title":"J. Parallel Distrib. Systems"},{"key":"BF00247794_CR18","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1145\/42411.42415","volume":"31","author":"John L. Gustafson","year":"1986","unstructured":"John L. Gustafson. Reevaluating Amdahl's law. Comm. ACM, 31:532\u2013533, 1986.","journal-title":"Comm. ACM"},{"key":"BF00247794_CR19","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R. Jonker","year":"1987","unstructured":"R. Jonker and A. Volgenant. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing, 38:325\u2013340, 1987.","journal-title":"Computing"},{"key":"BF00247794_CR20","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1287\/ijoc.3.2.92","volume":"3","author":"D. N. Kempa","year":"1991","unstructured":"D. N. Kempa, J. L. Kennington, and H. A. Zaki. Performance characteristics of the Jacobi and the Gauss-Seidel versions of the auction algorithm on the Alliant FX\/8. ORSA J. Comput., 3:92\u2013106, 1991.","journal-title":"ORSA J. Comput."},{"key":"BF00247794_CR21","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1287\/opre.40.1.178","volume":"40","author":"J. Kennington","year":"1992","unstructured":"J. Kennington and Z. Wang. A shortest augmenting path algorithm for the semi-assignment problem. Oper. Res., 40:178\u2013187, 1992.","journal-title":"Oper. Res."},{"key":"BF00247794_CR22","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/ijoc.3.4.299","volume":"3","author":"J. L. Kennington","year":"1991","unstructured":"J. L. Kennington and Z. Wang. An empirical analysis of the dense assignment problem: Sequential and parallel implementations. ORSA J. Comput., 3: 299\u2013306, 1991.","journal-title":"ORSA J. Comput."},{"key":"BF00247794_CR23","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York, 1976."},{"key":"BF00247794_CR24","unstructured":"MasPar Computer Corporation, Sunnyvale, CA. MasPar Parallel Application Language (MPL). Reference Manual. Software Version 3.2, May 1993."},{"key":"BF00247794_CR25","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0167-6377(90)90026-2","volume":"9","author":"D. L. Miller","year":"1990","unstructured":"D. L. Miller, J. F. Pekny, and G. L. Thompson. Solution of large dense transportation problems using a parallel primal algorithm. Oper. Res. Lett., 9:319\u2013324, 1990.","journal-title":"Oper. Res. Lett."},{"key":"BF00247794_CR26","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982."},{"key":"BF00247794_CR27","unstructured":"L. Prechelt. Measurement of MasPar MP-1216A communication operations. Technical Report 01\/93, Institut f\u00fcr Programmstrukturen und Datenorganisation, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, 1993."},{"key":"BF00247794_CR28","volume-title":"Network flows and monotropic optimization","author":"R. T. Rockafellar","year":"1984","unstructured":"R. T. Rockafellar. Network flows and monotropic optimization. John Wiley & Sons, New York, 1984."},{"key":"BF00247794_CR29","unstructured":"T. S\u00f8revik. Average case complexity analysis of algorithms for the linear assignment problem. In Proceedings of NOAS '93, NTH, Trondheim, Norway, 1993."},{"key":"BF00247794_CR30","volume-title":"An SIMD, fine-grained, parallel algorithm for the dense linear assignment problem","author":"S. Stor\u00f8y","year":"1992","unstructured":"S. Stor\u00f8y and T. S\u00f8revik. An SIMD, fine-grained, parallel algorithm for the dense linear assignment problem. Report 72, Department of Informatics, University of Bergen, Bergen, Norway, 1992."},{"key":"BF00247794_CR31","volume-title":"Massively parallel augmenting path algorithms for the assignment problem","author":"S. Stor\u00f8y","year":"1994","unstructured":"S. Stor\u00f8y and T. S\u00f8revik. Massively parallel augmenting path algorithms for the assignment problem. Report, Department of Informatics, University of Bergen, Bergen, Norway, 1994."},{"key":"BF00247794_CR32","unstructured":"Thinking Machines Corporation. CM Fortran Language Reference Manual. Version 2.1. Cambridge, MA, January 1994."},{"key":"BF00247794_CR33","unstructured":"Z. Wang. The Shortest Augmenting Path Algorithm for Bipartite Network Problems. PhD thesis, Southern Methodist University, Dallas, TX, 1990."},{"key":"BF00247794_CR34","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0743-7315(91)90092-N","volume":"13","author":"J. M. Wein","year":"1991","unstructured":"J. M. Wein and S. A. Zenios. On the massively parallel solution of the assignment problem. J. Parallel Distrib. Comput., 13:228\u2013236, 1991.","journal-title":"J. Parallel Distrib. Comput."},{"key":"BF00247794_CR35","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01299446","volume":"3","author":"S. A. Zenios","year":"1994","unstructured":"S. A. Zenios. Data parallel computing for network-structured optimization problems. Comput. Optim. Appl., 3:199\u2013242, 1994.","journal-title":"Comput. Optim. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00247794.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00247794\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00247794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T04:05:28Z","timestamp":1560917128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00247794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["BF00247794"],"URL":"https:\/\/doi.org\/10.1007\/bf00247794","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}