Author:
Lowe Timothy J.,Wendell Richard E.
Reference55 articles.
1. Achterberg T, Koch T, Martin A (2005) Branching rules revisited. Oper Res Lett 33:42–54
2. Adams WP, Johnson TA (1994) Improved linear programming-based lower bounds for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16. American Mathematical Society, Rhode Island, pp 43–75
3. Adams WP, Guignard M, Hahn PM, Hightower WL (2007) A level-2 reformulation--linearization technique bound for the quadratic assignment problem. Eur J Oper Res 180:983–996
4. Anstreicher KM (2003) Recent advances in the solution of quadratic assignment problems. Math Program 97:27–42
5. Anstreicher KM, Brixius NW (2001) A new bound for the quadratic assignment problem based on convex quadratic programming. Math Program 89:341–357