Approximation of convex curves with application to the bicriterial minimum cost flow problem.
Saved in:
| Title: | Approximation of convex curves with application to the bicriterial minimum cost flow problem. |
|---|---|
| Authors: | Fruhwirth, B.1, Burkard, R. E.1, Rote, G.1 |
| Source: | European Journal of Operational Research. 10/16/89, Vol. 42 Issue 3, p326-338. 13p. 2 Diagrams, 4 Charts, 6 Graphs. |
| Subjects: | Approximation theory, Functional analysis, Piecewise linear topology, Manifolds (Mathematics), Differential geometry, Complex manifolds |
| Abstract: | An approximation of an explicitly or implicitly given convex curve in the plane is given by two piecewise linear 'outer' and 'inner' curves. To compute these, three rules for choosing the supporting points are proposed and it is shown for two of them that the projective distance between inner and outer approximation decreases quadratically with the number of supporting points. This method is applied to approximate the efficient point curve of the Bicriterial Minimum Cost Flow Problem, which is a piecewise linear convex curve that may have an exponential number of breakpoints in the worst case. [ABSTRACT FROM AUTHOR] |
| Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
