Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-monge matrices

By Demidenko V.   Dolgui A.  

Cybernetics and Systems Analysis, Vol. 43, Iss. 1, 2007-01 ,pp. : 112-125

Springer Publishing Company

Access to resources Recommend Favorite

The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases

By Burkard R.E.   Cela E.   Rote G.   Woeginger G.J.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 125-158

Elsevier

Access to resources Recommend Favorite

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

By Çela Eranda   Klinz Bettina   Meyer Christophe  

Journal of Combinatorial Optimization, Vol. 12, Iss. 3, 2006-11 ,pp. : 187-215

Springer Publishing Company

Access to resources Recommend Favorite

Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices

By Deineko Vladimir   Steiner George   Xue Zhihui  

Journal of Combinatorial Optimization, Vol. 9, Iss. 4, 2005-06 ,pp. : 381-399

Springer Publishing Company

Access to resources Recommend Favorite

A Hybrid Metaheuristic for the Quadratic Assignment Problem

By Tseng Lin-Yu   Liang Shyi-Ching  

Computational Optimization and Applications, Vol. 34, Iss. 1, 2006-05 ,pp. : 85-113

Springer Publishing Company

Access to resources Recommend Favorite