Computermethoden zur Lösung einiger konkreter kombinatorischer ...

Literaturverzeichnis
Adler 1974
ADLER, I.: Lower Bounds for Maximum Diameters of Polytopes. Pivoting and
Extensions. M. Balinski (Ed.). In: Mathematical Programming Study. 1974 (1,
(1974)), S. 11–19 52
Adler u. a. 1987
ADLER, I. ; KARP, Rm. M. ; SHAMIR, R.: A simplex variant solving an m×d linear
program in O(min(m 2 ,d 2 ) expected number of steps. In: Journal of Complexity.
1987 (32, (1987)), S. 372 – 387 48
Adler u. Megiddo 1985
ADLER, I. ; MEGIDDO, N.: A simplex algorithm where the average number of
steps is bounded between two quadratic functions of the smaller dimensions. In:
Journal of the ACM. 1985 (32, (1985)), S. 871 – 895 48
Aigner 1979
AIGNER, M.: Combinatorial Theory. Berlin, Heidelberg, New York : Springer-
Verlag, 1979
Alon 1986
ALON, N.: The Number of Polytopes, Configurations and real Matroids. In:
Matematika. 1986 (33 (1986)), S. 62–71 75
Altschuler u. a. 1980
ALTSCHULER, A. ; BOKOWSKI, J. ; STEINBERG, L.: The classification of simplicial
3-Spheres with nine Certices into Polytopes and Nonpolytopes. In: Discrete
Mathematics. 1980 (31 (1980)), S. 115–124 70
Barnette 1971
BARNETTE, D. W.: The minimum number of vertices of a simple polytope. In:
Israel Journal of Math. 1971 (10, (1971)), S. 121–125 53
Beinsteiner Somm
BEINSTEINER, A.: An Introduction to Linear Programming. In: Seminar ”Algorithms
in Combinatorics”, superviser Nao Hirokawa. University of Innsbruck,
77