Approximation of convex curves with application to the bicriterial minimum cost flow problem
This paper presents three methods for approximating an implicitly or explicitly given convex curve in the plane by two convex, piecewise linear functions. The method is applied to approximate the efficient point curve of the bicriterial minimum cost flow problem. Some computational results are presented.
scientific article; zbMATH DE number 4121334
scientific article