共 50 条
- [41] SOLVING INTEGER MINIMUM COST FLOWS WITH SEPARABLE CONVEX COST OBJECTIVE POLYNOMIALLY MATHEMATICAL PROGRAMMING STUDY, 1986, 26 : 237 - 239
- [46] Concave minimum cost network flow problems solved with a colony of ants Journal of Heuristics, 2013, 19 : 1 - 33
- [50] STUDY OF OPTIMAL CONFIGURATION OF A TELECOMMUNICATION RECESS WITH FUNCTIONS OF CONCAVE COST ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS, 1974, 29 (3-4): : 139 - 171