Computermethoden zur Lösung einiger konkreter kombinatorischer ...

82 Literaturverzeichnis
Kalai 1997
KALAI, G.: Linear programming, the simplex algorithm and simple polytopes. In:
Mathematical Programming. 1997 (79, (1997)), S. 217 – 233
Kalai u. Kleitman 1992
KALAI, G. ; KLEITMAN, D. J.: A quasi-polynomial bound for the diameter of
graphs of polyhedra. In: Bulletin Amer. Math. Soc. 1992 (26, (1992)), S. 315–316
52
Kalbfleisch 1965
KALBFLEISCH, J. G.: Construction of Special Edge-Chromatic Graphs. In: Canadian
Mathematical Bulletin. 1965 (8 (1965)), S. 575–584 16, 32
Kalbfleisch 1966
KALBFLEISCH, J. G.: Chromatic Graphs and Ramsey’s Theorem (Ph.D. thesis).
University of Waterloo, 1966 16, 24, 25, 41, 44
Kantorovich 1960
KANTOROVICH, L. V.: Mathematical methods in the organization and planning of
production (in Russian). In: Management Science. 1960 (6, (1960)), S. 363 – 422
Karmarkar 1984
KARMARKAR, N. K.: A new polynomial-time algorithm for linear programming.
In: Combinatorica. 1984 (4, (1984)), S. 373–395 48
Kéry 1964
KÉRY, G.: On a Theorem of Ramsey (in Hungarian). In: Matematikai Lapok.
1964 (15 (1964)), S. 204–224 16
Khachiyan 1979
KHACHIYAN, L. G.: A polynomial algorithm in linear programming (in Russian).
In: Soviet Mathematics Doklady. 1979 (20, (1979)), S. 191–194 48
Khachiyan 1980
KHACHIYAN, L. G.: Polynomial algorithms in linear programming (in Russian).
In: Computational Mathematics and Mathematical Physics. 1980 (20, (1980)), S.
53–72
Kim 1995
KIM, J.H.: The Ramsey Numbers R(3,t) has Order of Magnitude t
logt
Structures and Algorithms. 1995 (7 (1995)), S. 173–207 19
. In: Random
Klee 1966
KLEE, V.: Path on Polyhedra. II. In: Pacific Journal of Mathematics. 1966 (17
(1966)), S. 249–262