Author:
Caprara Alberto,Monaci Michele
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference45 articles.
1. Alarie S., Audet C., Jaumard B., Savard G. (2001). Concavity cuts for disjoint bilinear programming. Math. Program. 90: 373–398
2. Al-Khayyal F.A. (1992). Generalized bilinear programming: Part I. Models, applications and linear programming relaxation. Eur. J. Oper. Res. 60: 306–314
3. Al-Khayyal F.A., Sherali H.D. (2000). On finitely terminating branch-and-bound algorithms for some global optimization problems. SIAM J. Optim. 10: 1049–1057
4. Applegate, D.L., Buriol, L.S., Dillard, B.L., Johnson, D.S., Shor, P.W.: The cutting-stock approach to bin packing: theory and experiments. In: Ladner, R.E. (ed.) Procedings of the 5th Workshop on Algorithm Engineering and Experimentation, Baltimore, pp. 1–15. SIAM, Philadelphia (2003)
5. Audet C., Hansen P., Jaumard B., Savard G. (1999). A symmetrical linear maxmin approach to disjoint bilinear programming. Math. Program. 85: 573–592
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献