[1]

R. Ahuja andJ.B. Orlin, “An Improved Algorithm for Computing the Min Cycle Mean”, Unpublished Manuscript, Nov. 1987.

[2]

M.L. Balinski, Signature methods for the assignment problem,

*Oper. Res.* 33 (1985) 527–537.

Google Scholar [3]

M.L. Balinski, A competitive (dual) simplex method for the assignment problem,

*Math. Progr.* 34 (1986) 125–141.

CrossRefGoogle Scholar [4]

R. Barr, F. Glover and

D. Klingman, The alternating basis algorithm for assignment problems,

*Math. progr.* 13 (1977) 1–13.

CrossRefGoogle Scholar [5]

G.M. Baudet, Asynchronous iterative methods for multiprocessors,

*J. ACM* 15 (1978) 226–244.

CrossRefGoogle Scholar [6]

D.P. Bertsekas, A distributed algorithm for the assignment problem,*Laboratory for Information and Decision Systems* Working Paper (M.I.T., March 1979).

[7]

D.P. Bertsekas, A new algorithm for the assignment problem,

*Math. Progr.* 21 (1981) 152–171.

CrossRefGoogle Scholar [8]

D.P. Bertsekas, A Distributed Asynchronous Relaxation Algorithm for the Assignment Problem,*Proc. 24th IEEE Conf. Decision and Control* (Ft Lauderdale, Fla., Dec. 1985) pp. 1703–1704.

[9]

D.P. Bertsekas, A unified framework for primal-dual methods in minimum cost network flow problems,

*Math. Progr.* 32 (1985) 125–145.

CrossRefGoogle Scholar [10]

D.P. Bertsekas, Distributed asynchronous computation of fixed points,

*Math. Progr.* 27 (1983) 107–120.

Google Scholar [11]

D.P. Bertsekas,*Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems*, LIDS Report P-1606 (M.I.T., Sept. 1986, revised Nov. 1986).

[12]

D.P. Bertsekas, Distributed relaxation methods for linear network flow problems, in:*Proc. 25th IEEE Conf. Decision and Control, Athens, Greece* (1986) pp. 2101–2106.

[13]

D.P. Bertsekas andD. Castanon, The Auction Algorithm for Transportation Problems, unpublished manuscript (Nov. 1987).

[14]

D.P. Bertsekas andJ. Eckstein, Distributed asynchronous relaxation methods for linear network flows problems,*Proc. IFAC '87*, Munich, Germany (July 1987).

[15]

D.P. Bertsekas and

D. El Baz, Distributed asynchronous relaxation methods for convex network flow problems,

*SIAM J. Control Optim.* 25 (1987) 74–85.

CrossRefGoogle Scholar [16]

D.P. Bertsekas andP. Tseng, Relaxation methods for minimum cost ordinary and generalized network flow problems, LIDS Report P-1462, M.I.T., May 1985,*Oper. Res.* to appear.

[17]

D.P. Bertsekas andP. Tseng, RELAX: A Code for Linear Network Flow Problems, in*FORTRAN Codes for Network Optimization*, (B. Simeone, ed.), Vol to be published by the*Annals of Operations Research*.

[18]

D.P. Bertsekas, P.A. Hosein and

P. Tseng, Relaxation methods for network flow problems,

*SIAM J. Control Optim.* 25 (1987) 1219–1243.

CrossRefGoogle Scholar [19]

D.P. Bertsekas, and

J.N. Tsitsiklis,

*Parallel and Distributed Computation: Numerical Methods* (Prentice-Hall, Englewood Cliffs, N.J., 1988) to appear.

Google Scholar [20]

D.P. Bertsekas, J.N. Tsitsiklis andM. Athans,*Convergence Theories of Distributed Asynchronous Computation: A Survey*, LIDS Report P-1412, M.I.T., Oct. 1984; also in:*Stochastic programming*, eds.F. Archetti, G. Di Pillo, andM. Lucertini, (Springer-Verlag, N.Y., 1986) pp. 107–120.

[21]

R.G. Bland andD.L. Jensen,*On the Computational Behaviour of a Polynomial-Time Network Flow Algorithm*, Tech. Report 661 (School of Operations Research and Industrial Engineering, Cornell University, June 1985).

[22]

D. Chazan and

W. Miranker, Chaotic relaxation,

*Linear Algebra Appl.* 2 (1969) 199–222.

CrossRefGoogle Scholar [23]

V.P. Crawford and

E.M. Knoer, Job matching with heterogeneous firms and workers,

*Econometrica* 49 (1981) 437–450.

Google Scholar [24]

E. Dinic andM. Kronrod, An algorithm for the solution of the solution of the assignment problem,*Soviet Math. Dokl.* 10 (1969).

[25]

J. Edmonds and

R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems,

*J. ACM* 19 (1972) 248–264.

CrossRefGoogle Scholar [26]

M. Engquist, A successive shortest path algorithm for the assignment problem,

*INFOR* 20 (1982) 370–384.

Google Scholar [27]

H.N. Gabow andR.E. Tarjan, Faster scaling algorithms for graph matching, Revised Abstract, 1987.

[28]

F. Glover, R. Glover andD. Klingman,*Threshold Assignment Algorithm*, Center for Business Decision Analysis report CBDA 107 (Graduate School of Business, Univ. of Texas at Austin, Sept. 1982).

[29]

A.V. Goldberg, Solving minimum-cost flow problems by successive approximations, extended abstract, submitted to*STOC 87 (Nov. 1986)*.

[30]

A. V. Goldberg,*Efficient Graph Algorithms for Sequential and Parallel Computers*, Tech. Report TR-374, Laboratory for Computer Science, M.I.T., Feb. 1987.

[31]

A.V. Goldberg, andR.E. Tarjan, Solving minimum cost flow problems by successive approximation, in:*Proc. 19th ACM STOC*, May 1987.

[32]

D. Goldfarb, Efficient dual simplex methods for the assignment problem,

*Math. Progr.* 33 (1985) 187–203.

CrossRefGoogle Scholar [33]

M. Hung, A polynomial simplex method for the assignment problem,

*Oper. Res.* 31 (1983) 595–600.

Google Scholar [34]

M. Hung and

W. Rom, Solving the assignment problem by relaxation,

*Oper. Res.* 28 (1980) 969–982.

Google Scholar [35]

J. Kennington and

R. Helgason,

*Algorithms for Network Programming* (Wiley, New York, 1980).

Google Scholar [36]

D. Klingman, A. Napier and

J. Stutz, NETGEN — A program for generating large scale (un)capacitated assignment, transportation, and minimum cost flow network problems,

*Management Sci.* 20 (1974) 814–822.

Google Scholar [37]

H.W. Kuhn, The Hungarian method for the assignment problem,

*Naval Res. Logistics Quarter.* 2 (1955) 83–97.

Google Scholar [38]

L.F. McGinnis, Implementation and testing of a primal-dual algorithm for the assignment problem,

*Oper. Res.* 31 (1983) 277–291.

Google Scholar [39]

J.B. Orlin,*Genuinely Polynomial Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem*, Working Paper No. 1615–84 (Sloan School of Management, M.I.T., Dec. 1984).

[40]

C.H. Papadimitriou and

K. Steiglitz,

*Combinatorial Optimization: Algorithms and Complexity* (Prentice-Hall, Englewood Cliffs, N.J. 1982).

Google Scholar [41]

H. Rock, Scaling techniques for minimal cost network flows, in:

*Discrete Structures and Algorithms*, ed.

V. Page Carl Hansen, Munich, 1980.

Google Scholar [42]

R.T. Rockafellar,

*Network Flows and Monotropic programming* (J. Wiley, New York, 1984).

Google Scholar [43]

A.E. Roth, The economics of matching: stability and incentives,

*Math. Oper. Res.* 7 (1982) 617–628.

Google Scholar [44]

L.S. Shapley and

M. Shubik, The assignment game I: the core,

*Intern. J. Game Theory* 1 (1972) 117–130.

Google Scholar [45]

E. Tardos, A strongly polynomial minimum cost circulation algorithm,

*Combinatorica* 5 (1985) 247–255.

Google Scholar [46]

A. Weintraub and

F. Barahona,

*A Dual Algorithm for the Assignment Problem*, Publ. No. 79/02/C (Departmento de Industrias, Universidad de Chile-Sede Occidente, Santiago, Chile, 1979).

Google Scholar [47]

S.A. Zenios and

J.M. Mulvey, Relaxation techniques for strictly convex network problems,

*Ann. Oper. Res.* 5 (1985/86), 517–538.

CrossRefGoogle Scholar [48]

S.A. Zenios andR.A. Lasken,*Nonlinear Network Optimization on a Massively Parallel Connection Machine*, Report 87-08-03 (Decision Science Department, The Wharton School, Univ. of Pennsylvania, Aug. 1987).