1. Burkard R.E., Hamacher H.W., Rote G., Sandwich approximation of univariate convex functions with an applications to separable convex programming, Naval Res. Logist. 38 (1991), 911–924.
2. Fruhwirth B., Burkard R.E., Rote G., Approximation of convex curves with application to the bi-criteria minimum cost flow problem, European J. Oper. Res. 42 (1989), 326–338.
3. Goldfarb D., Idnani A., A numerically stable dual method for solving strictly convex quadratic programs, Math. Program. 27 (1983), 1–33.
4. Rote G., The convergence rate of the sandwich algorithm for approximating convex functions, Computing 48 (1992), 337–361.
5. Ruhe G., Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh, Z. Oper. Res. 32 (1988), 9–27.
6. Sedeno-Noda A., Gonzalez-Martin C., The biobjective minimum cost flow problem, European J. Oper. Res. 124 (2000), 591–600.
7. Siem A.Y.D., den Hertog D., Hoffmann A.L., A method for approximating univariate convex functions using only function value evaluations, CentER Discussion Paper 67 (2007), 1–26.
8. Yang X.Q., Goh C.J., Analytic efficient solution set for multi-criteria quadratic programs, European J. Oper. Res. 92 (1996), 166–181.
9. Yang X.Q., Goh C.J., A method for convex curve approximation, European J. Oper. Res. 97 (1997), 205–212.
10. Zadeh N., A bad network for the simplex method and other minimum cost flow algorithms, Math. Program. 5 (1973), 255–266.
Google Scholar
10.1515/amsil
English