Approximation of convex curves with application to the bicriterial minimum cost flow problem (Q1825606): Difference between revisions
From MaRDI portal
Latest revision as of 11:18, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation of convex curves with application to the bicriterial minimum cost flow problem |
scientific article |
Statements
Approximation of convex curves with application to the bicriterial minimum cost flow problem (English)
0 references
1989
0 references
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.
0 references
multiple criteria programming
0 references
network programming
0 references
convex curve
0 references
convex, piecewise linear functions
0 references
bicriterial minimum cost flow problem
0 references
0 references
