The name is absent

31

[3] H.W. Kuhn, "Simplicial approximation of fixed points”, Proceedings of Na-
tional Academy of Science 61 (1968) 1238-1242.

[4] G. van der Laan, Simplicial Fixed Point Algorithms, CWI, Amsterdam, 1981.

[5] G. van der Laan and A.J.J. Talman, “A restart algorithm for computing fixed
points without an extra dimension”, Mathematical Programming 17 (1979) 74-
84.

[6] G. van der Laan and A.J.J. Talman, ”A class of simplicial restart fixed point
algorithms without an extra dimension”, Mathematical Programming 20 (1981)
33-48.

[7] G. van der Laan, A.J.J. Talman and L. Van der Heyden, ’’Simplicial variable
dimension algorithms for solving the nonlinear complementarity problems on a
product of unit simplices using a general labeling”, Mathematics of Operations
Research 12 (1987) 377-397.

[8] H.W.,Jr. Lenstra, ’’Integer programming with a fixed number of variables”,
Mathematics of Operations Research 8 (1983) 538-548.

[9] G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization,
John Wiley & Sons, New York, 1988.

[10] M. Newman, Integral Matrices, Academic Press, New York, 1972.

[11] H. Scarf, ’’Production sets with indivisibilities-part II: the case of two activi-
ties”, Econometrica 49 (1981) 395-423.

[12] H. Scarf, ’’Production sets with indivisibilities-part I: generalities”, Economet-
rica 49 (1981) 1-32.

[13] H. Scarf, The Computation of Economic Equilibria, Yale University Press, New
Haven, 1973.

<<   30   31   32   33   34   >>

More intriguing information