论文信息 - Approximation of convex curves with application to the bicriterial minimum cost flow problem - 字舞流文

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

G. Rote | B. Fruhwirth | R. E. Bukkard

[1] Norman Zadeh,et al. A bad network problem for the simplex method and other minimum cost flow algorithms , 1973, Math. Program..

[2] Darwin Klingman,et al. NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[3] Y. Aneja,et al. BICRITERIA TRANSPORTATION PROBLEM , 1979 .

[4] Joachim H. Ahrens,et al. Primal transportation and transshipment algorithms , 1980, Z. Oper. Research.

[5] Paolo Serafini,et al. Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems , 1987 .

[6] Günther Ruhe,et al. Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh , 1988, ZOR Methods Model. Oper. Res..