Approximation of convex curves with application to the bicriterial minimum cost flow problem
作者： B. Fruhwirth , R.E. Bukkard , G. Rote
DOI: 10.1016/0377-2217(89)90443-8
关键词:
摘要: … for approximating an implicitly or explicitly given convex curve C … to approximate convex curves or segments of convex curves in … This property of the convex curve allows us to choose a …
elsevier.com
sci-hub.se 参考文章(6)
Y. P. Aneja, K. P. K. Nair, BICRITERIA TRANSPORTATION PROBLEM Management Science. ,vol. 25, pp. 73- 78 ,(1979) , 10.1287/MNSC.25.1.73
J. H. Ahrens, G. Finke, Primal transportation and transshipment algorithms Zeitschrift für Operations Research. ,vol. 24, pp. 1- 32 ,(1980) , 10.1007/BF01920269
D. Klingman, A. Napier, J. Stutz, NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems Management Science. ,vol. 20, pp. 814- 821 ,(1974) , 10.1287/MNSC.20.5.814
G. Ruhe, Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh Zeitschrift für Operations Research. ,vol. 32, pp. 9- 27 ,(1988) , 10.1007/BF01920568
Paolo Serafini, Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems Springer, Berlin, Heidelberg. pp. 222- 232 ,(1987) , 10.1007/978-3-642-46618-2_15
Norman Zadeh, A BAD NETWORK PROBLEM FOR THE SIMPLEX METHOD AND OTHER MINIMUM COST FLOW ALGORITHMS Mathematical Programming. ,vol. 5, pp. 255- 266 ,(1973) , 10.1007/BF01580132