Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference13 articles.
1. A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
2. M.R. 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(4) (1972) 448–461.
3. P. Brucker, “An O(n) algorithm for quadratic knapsack problems,”Operations Research Letters 3 (1984) 163–166.
4. P.H. Calamai and J.J. Moré, “Quasi-Newton updates with bounds,”SIAM Journal on Numerical Analysis 24 (1987) 1434–1441.
5. N.J. Driebeek, “An algorithm for the solution of mixed integer programming problems,”Management Science 12 (1966) 576–587.
Cited by
115 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献