Polynomial algorithms for solving the quadratic assignment problem on networks

By Zabudskii G.  

Computational Mathematics and Mathematical Physics, Vol. 50, Iss. 11, 2010-11 ,pp. : 1948-1955

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

The Sum Vector S and the Fictitious Time s in the Kepler Problem

By Vivarelli M.D.  

Meccanica, Vol. 35, Iss. 1, 2000-01 ,pp. : 55-67

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem

By Kravtsov V.  

Cybernetics and Systems Analysis, Vol. 41, Iss. 6, 2005-11 ,pp. : 940-944

Springer Publishing Company

Access to resources Recommend Favorite

Exact and heuristic algorithms for solving the generalized minimum filter placement problem

By Mofya E.   Smith J.  

Journal of Combinatorial Optimization, Vol. 12, Iss. 3, 2006-11 ,pp. : 231-256

Springer Publishing Company

Access to resources Recommend Favorite

Chebyshev polynomial acceleration for block SOR methods for solving the rank-deficient least-squares problem

By Zheng Bing  

International Journal of Computer Mathematics, Vol. 88, Iss. 1, 2011-01 ,pp. : 6-20

Taylor & Francis Ltd

Access to resources Recommend Favorite