Theory of linear and integer programming
Theory of linear and integer programming
A new lower bound via projection for the quadratic assignment problem
Mathematics of Operations Research
Solving Large Quadratic Assignment Problems in Parallel
Computational Optimization and Applications
P-Complete Approximation Problems
Journal of the ACM (JACM)
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
INFORMS Journal on Computing
Non-standard approaches to integer programming
Discrete Applied Mathematics
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
Paper: Robust taboo search for the quadratic assignment problem
Parallel Computing
Effective formulation reductions for the quadratic assignment problem
Computers and Operations Research
| Hi-index | 0.01 |
New mixed-integer linear programming formulations are presented for the quadratic assignment problem, based on splittings of the coefficient matrices. Computational results are reported for medium-sized problem instances in the QAPLIB collection.