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

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

A polynomially solvable case of optimal linear extension problem of a poset

By Wu Biao   Yao Enyu   Liu Longcheng  

Journal of Combinatorial Optimization, Vol. 20, Iss. 4, 2010-11 ,pp. : 422-428

Springer Publishing Company

Access to resources Recommend Favorite

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

Penalty Parameter for Linearly Constrained 0–1 Quadratic Programming

By Zhu W.X.  

Journal of Optimization Theory and Applications, Vol. 116, Iss. 1, 2003-01 ,pp. : 229-239

Springer Publishing Company

Access to resources Recommend Favorite