Distributed algorithms for dynamic reassignment
暂无分享,去创建一个
[1] Egon Balas,et al. A parallel shortest augmenting path algorithm for the assignment problem , 1991, JACM.
[2] Andrew V. Goldberg,et al. Solving minimum-cost flow problems by successive approximation , 1987, STOC.
[3] Robert Murphey,et al. An Approximate Algorithm For A Weapon Target Assignment Stochastic Program , 2000 .
[4] D.A. Castanon,et al. Model predictive control for dynamic unreliable resource allocation , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..
[5] Dimitri P. Bertsekas,et al. Parallel Asynchronous Hungarian Methods for the Assignment Problem , 1993, INFORMS J. Comput..
[6] Andrew V. Goldberg,et al. Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..
[7] Bogumil Ulanicki,et al. Parallel Computing in Water Network Analysis and Optimization Processes , 1999 .
[8] Dimitri P. Bertsekas,et al. Parallel primal-dual methods for the minimum cost flow problem , 1993, Comput. Optim. Appl..
[9] Dimitri P. Bertsekas,et al. Parallel synchronous and asynchronous implementations of the auction algorithm , 1991, Parallel Comput..
[10] Egon Balas,et al. A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM , 1989 .
[11] M. Engquist. A Successive Shortest Path Algorithm for The Assignment Problem , 1982 .