A parametric approach for maximum flow problems with an additional reverse convex constraint
暂无分享,去创建一个
[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[2] Panos M. Pardalos,et al. A polynomial time solvable concave network flow problem , 1993, Networks.
[3] R. Horst,et al. Global Optimization: Deterministic Approaches , 1992 .
[4] Takahito Kuno,et al. A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost , 1996, J. Glob. Optim..
[5] Takahito Kuno,et al. Minimizing a linear multiplicative-type function under network flow constraints , 1997, Oper. Res. Lett..
[6] Peter Värbrand,et al. The Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs , 1995, J. Glob. Optim..
[7] H. Tuy,et al. Strongly polynomial algorithm for a production-transportation problem with concave production cost , 1993 .
[8] Panos M. Pardalos,et al. Minimum concave-cost network flow problems: Applications, complexity, and algorithms , 1991 .
[9] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[10] Bettina Klinz,et al. Minimum Concave-Cost Network Flow Problems with a Single Nonlinear Arc Cost , 1993 .
[11] Hoang Tuy,et al. Strongly polynomial time algorithms for certain concave minimization problems on networks , 1993, Oper. Res. Lett..
[12] M. Iri. A NEW METHOD OF SOLVING TRANSPORTATION· NETWORK PROBLEMS , 1960 .
[13] P. Pardalos,et al. Handbook of global optimization , 1995 .
[14] J. G. Evans,et al. Post Optimal Analyses, Parametric Programming and Related Topics , 1981 .