Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications
Reference15 articles.
1. Aneja, Y.P., Aggarwal, V. and Nair, K.P.K. (1984), ?On a class of quadratic programs?, European Journal of Operational Research 18, 62?70.
2. Garey, M.R. and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman.
3. Karp, R.M. (1972), Reducibility among combinatorial problems. in Complexity of Computer Computations (R.E. Miller and J.W. Thatcher eds.), Plenum Press.
4. Konno, H. and Kuno, T. (1990), Generalized linear multiplicative and fractional programming, Annals of Operations Research 25, 147?162.
5. Konno, H., Yajima, Y. and Matsui, T. (1991), Parametric simplex algorithms for solving a special class of nonconvex minimization problems, Journal of Global Optimization 1, 65?82.
Cited by
119 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献