Approximation of convex curves with application to the bicriterial minimum cost flow problem
- 16 October 1989
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 42 (3) , 326-338
- https://doi.org/10.1016/0377-2217(89)90443-8
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Complexity results for multicriterial and parametric network flows using a pathological graph of ZadehMathematical Methods of Operations Research, 1988
- Primal transportation and transshipment algorithmsMathematical Methods of Operations Research, 1980
- Bicriteria Transportation ProblemManagement Science, 1979
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network ProblemsManagement Science, 1974
- A bad network problem for the simplex method and other minimum cost flow algorithmsMathematical Programming, 1973