Author:  
All :: A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z 
All :: Kaad, ... , Koerwien, Kohlberg, Kohn, ... , Köhne 
References
55.
Bernhard Korte
Matroids and independence systems
Modern applied mathematics (Bonn, 1979)
page 517--553.
Publisher: North-Holland, Amsterdam-New York,
1982
54.
D. Hausmann and B. Korte
Algorithmic versus axiomatic definitions of matroids
Math. Programming Stud., (14):98--111
1981
53.
S. Albeverio, M. Fukushima, W. Karwowski and L. Streit
Capacity and quantum mechanical tunneling
Comm. Math. Phys., 81(4):501--513
1981
52.
A. Bachem and B. Korte
Estimating matrices
Metrika, 28(4):273--286
1981
51.
Dirk Hausmann, Ravindran Kannan and Bernhard Korte
Exponential lower bounds on a class of knapsack algorithms
Math. Oper. Res., 6(2):225--232
1981
50.
W. Kohnen and D. Zagier
Values of L-series of modular forms at the center of the critical strip
Invent. Math., 64(2):175--198
1981
49.
B. Korte and R. Schrader
A survey on oracle techniques
Mathematical foundations of computer science, 1981 (Strbské Pleso, 1981) Volume 118 of Lecture Notes in Comput. Sci.
page 61--77.
Publisher: Springer, Berlin-New York,
1981
48.
B. Korte and L. Lovász
Mathematical structures underlying greedy algorithms
Fundamentals of computation theory (Szeged, 1981) Volume 117 of Lecture Notes in Comput. Sci.
page 205--209.
Publisher: Springer, Berlin-New York,
1981
47.
Bernhard Korte and Rainer Schrader
On the existence of fast approximation schemes
Nonlinear programming, 4 (Madison, Wis., 1980)
page 415--437.
Publisher: Academic Press, New York-London,
1981
46.
B. Korte and R. Schrader
A note on convergence proofs for Shor-Khachian methods
Optimization and optimal control (Proc. Conf., Math. Res. Inst., Oberwolfach, 1980) Volume 30 of Lecture Notes in Control and Information Sci. , page 51--57.
Publisher: Springer, Berlin-New York,
1981
45.
Achim Bachem and Bernhard Korte
Minimum norm problems over transportation polytopes
Linear Algebra Appl., 31:103--118
1980
44.
D. Hausmann, B. Korte and T. A. Jenkyns
Worst case analysis of greedy type algorithms for independence systems
Math. Programming Stud., (12):120--131
1980
Page:  
Previous | 1, ... , 120, 121, 122, 123, 124, ... , 126 | Next
Export as:
BibTeX, XML