A method for convex curve approximation
type: Item
instance of: scholarly article
title: A method for convex curve approximation
zbMATH Open document ID: 0922.90066
DOI: 10.1016/0377-2217(95)00368-1
author: C. J. Goh
author: Xiao Qi Yang
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 65D15
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1253159
zbMATH Keywords: convex curve approximation
zbMATH Keywords: sandwich method
zbMATH Keywords: quadratic convergence
zbMATH Keywords: bi-criteria convex quadratic network program
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00368-1
OpenAlex ID: W2079511751
cites work: Bicriteria Transportation Problem
cites work: An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons
cites work: Sandwich approximation of univariate convex functions with an application to separable convex programming
cites work: Q3294638
cites work: Q3996571
cites work: Approximation of convex curves with application to the bicriterial minimum cost flow problem
cites work: Bicriteria network flow problems: Continuous case
cites work: The convergence rate of the sandwich algorithm for approximating convex functions
cites work: Q3995028
cites work: Analytic efficient solution set for bi-criteria quadratic network programs
cites work: A bad network problem for the simplex method and other minimum cost flow algorithms
description: scientific article; zbMATH DE number 1253159