共 50 条
- [1] Optimal capacity and flow assignment problem in a computer communication network [J]. 1600, (34): : 1 - 2
- [4] Algorithms for the non-bifurcated network design problem [J]. JOURNAL OF HEURISTICS, 2009, 15 (03) : 259 - 281
- [5] Routing and wavelength assignment for scheduled and random lightpath demands: Bifurcated routing versus non-bifurcated routing [J]. OPTICAL NETWORKS AND TECHNOLOGIES, 2005, 164 : 137 - 144
- [6] On application of ant algorithms to non-bifurcated multicommodity flow problem [J]. ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING - ICAISC 2004, 2004, 3070 : 922 - 927
- [7] Genetic algorithm for optimal flow assignment in computer network [J]. Computers and Industrial Engineering, 1998, 35 (3-4): : 535 - 538
- [9] JOINT OPTIMIZATION OF CAPACITY AND FLOW ASSIGNMENT IN A PACKET-SWITCHED COMMUNICATIONS NETWORK. [J]. IEEE Transactions on Communications, 1987, COM-35 (02): : 202 - 209
- [10] MIN-MAX FLOW CONTROL ALGORITHM FOR OPTIMAL COMPUTER NETWORK CAPACITY ASSIGNMENT. [J]. Conference Record - International Conference on Communications, 1980, 2 : 1 - 23