Approximation of convex curves with application to the bicriterial minimum cost flow problem

DOI10.1016/0377-2217(89)90443-8zbMath0684.65069MaRDI QIDQ1825606

Günter Rote, Rainer E. Burkard, Bernd Fruhwirth

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90443-8

zbMATH Keywords

network programming; convex curve; multiple criteria programming; bicriterial minimum cost flow problem; convex, piecewise linear functions

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

65D15: Algorithms for approximation of functions

Related Items

Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., Multiple objective minimum cost flow problems: a review, \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows, A methodology for assessing eco-efficiency in logistics networks, The convergence rate of the sandwich algorithm for approximating convex functions, A method for convex curve approximation, On the efficient point set of tricriteria linear programs, Approximation methods for non-convex curves, Multiobjective transportation network design and routing problems: Taxonomy and annotation, Finding representative systems for discrete bicriterion optimization problems, The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves, An optimal adaptive algorithm for the approximation of concave functions, Approximation methods in multiobjective programming, Sandwich approximation of univariate convex functions with an application to separable convex programming

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• The convergence rate of the sandwich algorithm for approximating convex functions
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
• Primal transportation and transshipment algorithms
• Bicriteria Transportation Problem
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A bad network problem for the simplex method and other minimum cost flow algorithms