Author:
Luedtke James,Namazifar Mahdi,Linderoth Jeff
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference24 articles.
1. Al-Khayyal, F., Falk, J.: Jointly constrained biconvex programming. Math. Oper. Res. 8(2), 273–286 (1983)
2. Bao, X., Sahinidis, N.V., Tawarmalani, M.: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs. Optim. Methods Softw. 24(4–5), 485–504 (2009)
3. Belotti, P., Lee, J., Liberti, L., Margot, F., Wachter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597–634 (2009)
4. Cho, J., Raje, S., Sarrafzadeh, M.: Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications. IEEE Trans. Comput. 47(11), 1253–1266 (1998)
5. Coppersmith, D., Günlük, O., Lee, J., Leung, J.: A polytope for a product of real linear functions in 0/1 variables. Technical report, IBM Research, Report RC21568 (1999)
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献