Parallel synchronous and asynchronous implementations of the auction algorithm

[1]  Stavros A. Zenios,et al.  Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization , 1991, Parallel Comput..

[2]  Jeffery L. Kennington,et al.  Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8 , 1991, INFORMS J. Comput..

[3]  Dimitri P. Bertsekas,et al.  Linear network optimization - algorithms and codes , 1991 .

[4]  J. M. Wein,et al.  Massively parallel auction algorithms for the assignment problem , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[5]  Dimitri P. Bertsekas,et al.  The Auction Algorithm for Assignment and Other Network Flow Problems , 1991 .

[6]  D. El Baz,et al.  A computational experience with distributed asynchronous iterative methods for convex network flow problems , 1989 .

[7]  D. Bertsekas,et al.  The auction algorithm for the transportation problem , 1989 .

[8]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[9]  Egon Balas,et al.  A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM , 1989 .

[10]  Dimitri P. Bertsekas,et al.  The auction algorithm for the minimum cost network flow problem , 1989 .

[11]  Paolo Toth,et al.  Algorithms and codes for the assignment problem , 1988 .

[12]  Dimitri P. Bertsekas,et al.  Dual coordinate step methods for linear network flow problems , 1988, Math. Program..

[13]  D. Bertsekas.  The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .

[14]  Dimitri P. Bertsekas,et al.  Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems , 1987 .

[15]  James H. Patterson,et al.  Portable Programs for Parallel Processors , 1987 .

[16]  James M. Boyle,et al.  Beyond "'Speedup": Performance Analysis of Parallel Programs , 1987 .

[17]  Andrew Vladislav Goldberg,et al.  Efficient graph algorithms for sequential and parallel computers , 1987 .

[18]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[19]  D. Bertsekas,et al.  Distributed asynchronous relaxation methods for convex network flow problems , 1987 .

[20]  Michel Balinski,et al.  A competitive (dual) simplex method for the assignment problem , 1986, Math. Program..

[21]  Darwin Klingman,et al.  Threshold assignment algorithm , 1986 .

[22]  Ulrich Derigs,et al.  The shortest augmenting path method for solving assignment problems — Motivation and computational experience , 1985 .

[23]  D. Bertsekas.  A distributed asynchronous relaxation algorithm for the assignment problem , 1985, 1985 24th IEEE Conference on Decision and Control.

[24]  Michel Balinski,et al.  Signature Methods for the Assignment Problem , 1985, Oper. Res..

[25]  Dimitri P. Bertsekas,et al.  A unified framework for primal-dual methods in minimum cost network flow problems , 1985, Math. Program..

[26]  Ming S. Hung,et al.  Technical Note - A Polynomial Simplex Method for the Assignment Problem , 1983, Oper. Res..

[27]  Leon F. McGinnis,et al.  Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem , 1983, Oper. Res..

[28]  M. Engquist.  A Successive Shortest Path Algorithm for The Assignment Problem , 1982 .

[29]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

[30]  G. Thompson.  A Recursive Method for Solving Assignment Problems , 1981 .

[31]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[32]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[33]  Darwin Klingman,et al.  The alternating basis algorithm for assignment problems , 1977, Math. Program..

[34]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[35]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[36]  Marshall Hall,et al.  An Algorithm for Distinct Representatives , 1956 .