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

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

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

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 programmingconvex curvemultiple criteria programmingbicriterial minimum cost flow problemconvex, piecewise linear functions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Algorithms for approximation of functions (65D15)

Related Items

From closed-loop to sustainable supply chains: the WEEE case ⋮ Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem ⋮ Sandwich approximation of univariate convex functions with an application to separable convex programming ⋮ Multiple objective minimum cost flow problems: a review ⋮ \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows ⋮ The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives ⋮ Finding representative systems for discrete bicriterion optimization problems ⋮ The convergence rate of the sandwich algorithm for approximating convex functions ⋮ A methodology for assessing eco-efficiency in logistics networks ⋮ The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ An optimal adaptive algorithm for the approximation of concave functions ⋮ Approximation of convex sets by polytopes ⋮ How Good is the Chord Algorithm? ⋮ A method for convex curve approximation ⋮ Approximation methods for non-convex curves ⋮ Approximation methods in multiobjective programming ⋮ On the efficient point set of tricriteria linear programs

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