References
- Behbinger , F.A. 1983 . Discrete and Nondiscrete Quasiconvexlike Functions and Single-Peakedness (Unimodality) . Math.Operationsforschung Statist.Ser.Optimization , 14 : 163 – 181 .
- Edmonds , J. and Fulkerson , D.R. 1970 . Bottleneck extrema . J.Combinatorial Theory , 8 : 229 – 306 .
- Edmonds , J. and Giles , R. 1977 . A min-max relation for submodular functions on graphs . Ann.Discrete Math , 1 : 185 – 204 .
- Edmonds , J. and Johnson , E.L. 1970 . “ Matching: a well-solved class of integer linear programs ” . In Combinatorial Structures and their Applications , 89 – 92 . New York : Gordon and Breach .
- Frank , A. Sep 1981b . Finding feasible vectors of Edmonds-Giles polyhedra , Sep , Universität Bonn . Report 81205-OR, Institut für Ökonomie und Operations Research
- Frank , A. 1982 . An algorithm for submodular functions on graphs . Ann.Discrete Math , 16 Sep : 97 – 120 .
- Fujishige , D. Oktober 1982 . Structures of polyhedra determined by submodular functions on crossing families , Oktober , Universität Bonn . Report 82236-OB, Institut fur Ökonometrie und Operations Rese-arch
- Ichimori , T. 1984 . Operations Research , Oktober to appear
- Lovász , L. Plats in matroids and geometric graphs . Combinatorial Surveys, Proe.6th British Combinatorial Conference . Edited by: Cameron , P.J. New York : Academic Press .
- Luenbebger , D.G. 1968 . Quasi convex Programming . SIAM J.Appl.Math , 18 : 1090 – 1095 .
- Schaible , S. and Ziemba , W.T. , eds. 1981 . Generalized Concavity in Optimization and Economics , New York : Academic Press .
- Schbijver , A. Total dual kite grality from directed graphs, crossing families, and sub- and supermodular functions . Proceedings of the Silver Jubilee Combinatorial Conference held in Waterloo . Jun 1982 . to appear
- Schbijver , A. 1984 . Polyhedral Methods in Combinatorics , New York : Wiley . to appear
- Stoer , J. and Witzgall , Ch . 1970 . Convexity and Optimization in finite dimensions I , Berlin : Springer .
- Zeitlin , Z. 1981 . Integer Allocation Problems of Min Max Type with Quasiconvex separable Functions . Operations Research , 29 : 207 – 211 .
- Zimmermann , U. 1981 . “ Linear and combinatorial optimization in ordered algebraic structures ” . In Ann.of Discrete Math , Vol. 10 , North Holland .
- Zimmebmann , U. 1982a . Minimization on submodular flows . Discrete Appl.Math , 4 : 303 – 323 .
- Zimmebmann , U. Aug 1982b . Augmenting circuit methods for submodular flow problems , Aug , Mathematisches Institut der Universität zu Köln . Report 82-03
- Zimmermann U. Linear and combinatorial Sharing Problems Mathematisches Institut der Universität zu Köln Aug 1983 Report 83-04,submitted for publication