Chapter 5 Parallel computing in network optimization

This publication has 69 references indexed in Scilit:

• Parallel Asynchronous Hungarian Methods for the Assignment Problem
  INFORMS Journal on Computing, 1993
• Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions
  INFORMS Journal on Computing, 1993
• A parallel shortest augmenting path algorithm for the assignment problem
  Journal of the ACM, 1991
• Parallel synchronous and asynchronous implementations of the auction algorithm
  Parallel Computing, 1991
• The auction algorithm: A distributed relaxation method for the assignment problem
  Annals of Operations Research, 1988
• Dual coordinate step methods for linear network flow problems
  Mathematical Programming, 1988
• Nonlinear programming on generalized networks
  ACM Transactions on Mathematical Software, 1987
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
  SIAM Journal on Control and Optimization, 1987
• Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
  SIAM Journal on Control and Optimization, 1987
• On a routing problem
  Quarterly of Applied Mathematics, 1958