The MCCNF Problem With a Fixed Number of Nonlinear Arc Costs: Complexity and Approximation
Reference35 articles.
1. D.-Z. Du and P.M. Pardalos (eds): Network Optimization Problems, World Scientific, 1993.
2. R.E. Erickson, C.L. Monna adn A.F. Veinott: Send-and-split method for minimum concave cost network flow, Mathematics of Operations Research 12 (1987), 634–664.
3. M. Florian and P. Robillard: An implicit enumeration algorithm for the concave cost network flow problem, Management Science 18 (1971), 184–193.
4. G. Gallo, C. Sandi and C. Sodini: An algorithm for the min concave cost flow problem, European Journal of Operations Research 4 (1980), 248–259.
5. G. Guisewite and P.M. Pardalos. Minimum concave cost network flow problems: Applications, complexity and algorithms, Annals of Operations Research 25 (1990), 75–100.