The nearest point problem in a polyhedral set and its extensions

By Liu Zhe  

Computational Optimization and Applications, Vol. 53, Iss. 1, 2012-09 ,pp. : 115-130

Springer Publishing Company

Access to resources Recommend Favorite

On problem of nearest common fixed point of nonexpansive mappings

By Zhang Shi-sheng  

Applied Mathematics and Mechanics, Vol. 27, Iss. 7, 2006-07 ,pp. : 883-889

Springer Publishing Company

Access to resources Recommend Favorite

A new interior-point algorithm based on modified Nesterov–Todd direction for symmetric cone linear complementarity problem

By Kheirfam B.   Mahdavi-Amiri N.  

Optimization Letters, Vol. 8, Iss. 3, 2014-03 ,pp. : 1017-1029

Springer Publishing Company

Access to resources Recommend Favorite

The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm

By Dumitrescu Irina  

Mathematical Programming, Vol. 121, Iss. 2, 2010-02 ,pp. : 269-305

Elsevier

Access to resources Recommend Favorite

Further Discussion on the Error Bound for Generalized Linear Complementarity Problem over a Polyhedral Cone

By Sun Hongchun   Wang Yiju  

Journal of Optimization Theory and Applications, Vol. 159, Iss. 1, 2013-10 ,pp. : 93-107

Springer Publishing Company

Access to resources Recommend Favorite