Author:
Hahn Peter M.,Kim Bum-Jin,Guignard Monique,Smith J. MacGregor,Zhu Yi-Rong
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference47 articles.
1. Adams, W.P., Sherali, H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32, 1274–1290 (1986)
2. Adams, W.P., Sherali, H.D.: Linearization strategies for a class of zero-one mixed integer programming problems. Oper. Res. 38, 217–226 (1990)
3. Adams, W.P., Guignard, M., Hahn, P.M., Hightower, W.L.: A level-2 reformulation-linearization technique bound for the quadratic assignment problem. Eur. J. Oper. Res. 180, 983–996 (2007)
4. Anstreicher, K.M., Brixius, N.W.: A new bound for the quadratic assignment problem based on convex quadratic programming. Math. Program. 89, 341–357 (2001)
5. Balachandran, V.: An integer generalized transportation model of optimal job assignment to computer networks. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, Working Paper 34-72-3 (1972)
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献