Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- 1 January 1988
- journal article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 32 (1) , 9-27
- https://doi.org/10.1007/bf01920568
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Algorithms for flows with parametric capacitiesMathematical Methods of Operations Research, 1989
- Parametric maximal flows in generalized networks – complexity and algorithmsOptimization, 1988
- Multiple Criteria Mathematical Programming: an Overview and Several ApproachesPublished by Springer Nature ,1985
- Complexity of some parametric integer and network programming problemsMathematical Programming, 1983
- Bicriterion Path ProblemsPublished by Springer Nature ,1980
- Graph Theory: An Algorithmic ApproachOperational Research Quarterly (1970-1977), 1976
- A bad network problem for the simplex method and other minimum cost flow algorithmsMathematical Programming, 1973
- Solving Bicriterion Mathematical ProgramsOperations Research, 1967