Author:
Chen Xi,Zhang Ji-hong,Ding Xiao-song,Yang Tian,Qian Jing-yi
Funder
NSFC
Young Faculty Research Fund of BFSU
Fundamental Research Funds for the Central Universities
Publisher
Springer Science and Business Media LLC
Reference10 articles.
1. Alarie, S., Audet, C., Jaumard, B., Savard, G.: Concavity cuts for disjoint bilinear programming. Math. Program. 90(2), 373–398 (2001)
2. Audet, C., Hansen, P., Jaumard, B., Savard, G.: A symmetrical linear maxmin approach to disjoint bilinear programming. Math. Program. 85(3), 573–592 (1999)
3. Konno, H.: Bilinear programming: Part II. Application of bilinear programming. Tech. Rept. No. 71–10, Department of Operations Research, Stanford University, Stanford, Calif. (1971)
4. Konno, H.: A cutting plane algorithm for solving bilinear programs. Math. Program. 11(1), 14–27 (1976)
5. Nahapetyan, A.: Bilinear programming: applications in the supply chain management. In: Encyclopedia of optimization, pp 282–288. Springer (2009)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献