Approximation of convex curves with application to the bicriterial minimum cost flow problem
type: Item
instance of: scholarly article
title: Approximation of convex curves with application to the bicriterial minimum cost flow problem
zbMATH Open document ID: 0684.65069
DOI: 10.1016/0377-2217(89)90443-8
published in: European Journal of Operational Research
publication date: 1989-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65D15
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 4121334
zbMATH Keywords: multiple criteria programming
zbMATH Keywords: network programming
zbMATH Keywords: convex curve
zbMATH Keywords: convex, piecewise linear functions
zbMATH Keywords: bicriterial minimum cost flow problem
author: Bernd Fruhwirth
author: Rainer E. Burkard
author: Günter Rote
describes a project that uses: NETGEN
MaRDI profile type: Publication
full work available at URL: 0377-2217(89)90443-8
OpenAlex ID: W2009348921
cites work: Primal transportation and transshipment algorithms
cites work: Bicriteria Transportation Problem
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: The convergence rate of the sandwich algorithm for approximating convex functions
cites work: Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
cites work: Q3802899
cites work: A bad network problem for the simplex method and other minimum cost flow algorithms
Recommended article: Bounded-curvature shortest paths through a sequence of points using convex optimization
Recommended article: \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
Recommended article: Approximation and/or construction of curves by minimization methods with or without constraints
Recommended article: A parametric algorithm for convex cost network flow and related problems
Recommended article: Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
Recommended article: Q4875214
Recommended article: Approximation algorithms for curvature-constrained shortest paths
Recommended article: A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
Recommended article: Minimum concave-cost network flow problems: Applications, complexity, and algorithms
Recommended article: Q3626256
description: scientific article; zbMATH DE number 4121334