共 50 条
- [1] A REDUCED SUBGRADIENT ALGORITHM FOR NETWORK FLOW PROBLEMS WITH CONVEX NONDIFFERENTIABLE COSTS [J]. LECTURE NOTES IN ECONOMICS AND MATHEMATICAL SYSTEMS, 1985, 255 : 318 - 322
- [2] A SCALED REDUCED GRADIENT ALGORITHM FOR NETWORK FLOW PROBLEMS WITH CONVEX SEPARABLE COSTS [J]. MATHEMATICAL PROGRAMMING STUDY, 1981, 15 (MAY): : 125 - 147
- [6] A Partitioned ∈-Relaxation Algorithm for Separable Convex Network Flow Problems [J]. Computational Optimization and Applications, 1999, 12 : 107 - 126
- [9] A primal–dual simplex algorithm for bi-objective network flow problems [J]. 4OR, 2009, 7 : 255 - 273
- [10] An algorithm to solve polyhedral convex set optimization problems [J]. OPTIMIZATION, 2013, 62 (01) : 131 - 141