Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. B.H. Arnold, “A topological proof of the fundamental theorem of algebra”, American Mathematical Monthly 56 (1949) 465–466.
2. B.C. Eaves, “Homotopies for the computation of fixed points”, Mathematical Programming 3 (1972) 1–23.
3. H.W. Kuhn, “Some combinatorial lemmas in topology”, IBM Journal of Research and Development, 4 (1960) 518–24.
4. H.W. Kuhn, “Simplicial approximation of fixed points”, Proceedings of the National Academy of Sciences 61 (1968) 1238–42.
5. H.W. Kuhn, “Approximate search for fixed points”, in: Computing methods in optimization problems 2, Eds. L.A. Zadeh, L.W. Neustadt, A.V. Balakrishnan (Academic Press, New York, 1969) pp. 199–211.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Simplicial Methods for Approximating Fixed Point with Applications in Combinatorial Optimizations;Handbook of Combinatorial Optimization;2013
2. Harold W. Kuhn;Profiles in Operations Research;2011
3. The Solution of Systems of Piecewise Linear Equations;Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research;2011
4. Combinatorial Stokes formulae;European Journal of Combinatorics;2008-01
5. Homotopy Methods;Nonconvex Optimization and Its Applications;1995