Author:
Chandrasekaran R.,Tamir A.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference10 articles.
1. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest and R.E. Tarjan, “Time bounds for selection,”Journal of Computer and System Sciences 7 (1972) 448–461.
2. P.H. Calamai and A.R. Conn, “A second-order method for solving the continuous multifacility location problem,” in: G.A. Watson, ed.,Numerical analysis: Proceedings of the Ninth Biennial Conference, Dundee, Scotland, Lecture Notes in Mathematics, Vol. 912 (Springer, Berlin, Heidelberg and New York, 1982) pp. 1–25.
3. J.A. Chatelon, D.W. Hearn and T.J. Lowe, “A subgradient algorithm for certain minimax and minisum problems,”Mathematical Programming 15 (1978) 130–145.
4. J.W. Eyster, J.A. White and W.W. Wierwille, “On solving multifacility location problems using a hyperboloid approximation procedure,”AIEE Transactions 5 (1973) 1–6.
5. I.N. Katz, “Local convergence in Fermat's problem,”Mathematical Programming 6 (1974) 89–104.
Cited by
77 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献