Efficient algorithms and codes for k-cardinality assignment problems
暂无分享,去创建一个
[1] Ravi Jain,et al. A note on scheduling problems arising in satellite communications , 1997 .
[2] Mauro Dell'Amico,et al. New bounds for optimum traffic assignment in satellite communication , 1998, Comput. Oper. Res..
[3] Andrew V. Goldberg,et al. An efficient implementation of a scaling minimum-cost flow algorithm , 1993, IPCO.
[4] D. Bertsekas,et al. The relax codes for linear minimum cost network flow problems , 1988 .
[5] Paolo Toth,et al. Linear Assignment Problems , 1987 .
[6] Mauro Dell'Amico,et al. Annotated Bibliographies in Combinatorial Optimization , 1997 .
[7] Mauro Dell'Amico,et al. The k-cardinality Assignment Problem , 1997, Discret. Appl. Math..
[8] Christian Prins,et al. An Overview of Scheduling Problems Arising in Satellite Communications , 1994 .
[9] Donald Goldfarb,et al. A computational comparison of the dinic and network simplex methods for maximum flow , 1988 .
[10] E. A. Dinic. Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .
[11] Carlos A. Pomalaza-Raez. A note on efficient SS/TDMA assignment algorithms , 1988, IEEE Trans. Commun..
[12] Paul Tseng,et al. Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..