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

Author： Deineko Vladimir Steiner George Xue Zhihui

Publisher： Springer Publishing Company

ISSN： 1382-6905

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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

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

On The Approximability Of The Traveling Salesman Problem

By Papadimitriou* Christos Vempala† Santosh

Combinatorica, Vol. 26, Iss. 1, 2006-02 ,pp. : 101-120

Springer Publishing Company

Access to resources Recommend Favorite

Well Solvable Cases of the Quadratic Assignment Problem with Monotone and Bimonotone Matrices

By Demidenko Vitali Finke Gerd Gordon Valery

Journal of Mathematical Modelling and Algorithms, Vol. 5, Iss. 2, 2006-06 ,pp. : 167-187

Springer Publishing Company

Access to resources Recommend Favorite

The symmetric quadratic traveling salesman problem

By Fischer Anja Helmberg Christoph

Mathematical Programming, Vol. 142, Iss. 1-2, 2013-12 ,pp. : 205-254

Elsevier

Access to resources Recommend Favorite