【1】王军,刘晶,孙利辉(2010),基于DEA系统潜力损失的决策单元全排序方法,河南科技大学学报,第31卷,第2期,100-104页 【2】王军,孙利辉,刘晶(2009),基于虚拟决策单元的DEA权排序方法,科研管理,第30卷,198-202页 【3】 D. Li, X. L. Sun, J. Wang and K.I.M. McKinnon (2009), Convergent Lagrangian and Domain Cut Method for Nonlinear Knapsack Problems, Computational Optimization and Applications, Vol. 42, No.1, pp.67-104.(SCI, EI5) 【4】D. Li, Q. Wang, J. Wang and Y. R. Yao (2008), Mitigation of curse of dimensionality in dynamic programming, Proceedings of the International Federation of Automatic Control, Seoul, Korea, July 6-11, 2008, PP.7778-7783.(ISTP) 【5】王军,孙利辉,吴迪(2008), 竞合环境下基于信誉与契约的组织间知识共享激励研究,河南科技大学学报(自然科学版),第29卷,第一期,92-95页 【6】J. Wang, D. Li and X. L. Sun (2007), A revised Taha's algorithm for polynomial 0-1 programming, Optimization,Vol. 56, No.5, pp. 699-713.(SCI, EI) 【7】D. Li, J. Wang and X. L. Sun (2007), Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut method, Journal of Global Optimization. Vol. 39, No.1, pp.127-154.(SCI, EI) 【8】王军,李端(2007),多项式0-1规划中隐枚举算法的改进及应用,系统工程理论与实践,第27卷,第三期,21-27页。(EI) 【9】 孙利辉,徐寅丰,王军(2007),研究联合体形成博弈及均衡结构的存在性研究,系统工程理论与实践,第27卷,第三期,78-81页(EI) 【10】J. Wang, M. Long and D. Li (2006), A total unimodularity based branch-and-bound method for integer programming, Asia Pacific Conference on Circuits and Systems, Singapore, Dec. 4-7, 2006, PP.643-646. (EI) 【11】王军,李端(2006),多项式0-1规划的改进隐枚举算法,中国系统工程学会14届年会,2006年10月30-11月2日,中国,厦门 (大会优秀论文奖) 【12】D. Li, X. L. Sun and J. Wang (2006), Optimal integer solution to the Markowitz’s mean-variance formulation for portfolio Selection: convergent Lagrangian and contour-domain cut method, Mathematical Finance. Vol. 16, No.1, pp. 83-101.(SCI)