Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems

Author： Lorena L.A.N. Goncalves Narciso M.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.138, Iss.3, 2002-05, pp. : 473-483

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

Lagrangean/surrogate relaxation for generalized assignment problems

By Narciso M.G. Lorena L.A.N.

European Journal of Operational Research, Vol. 114, Iss. 1, 1999-04 ,pp. : 165-177

Elsevier

Access to resources Recommend Favorite

Genetic algorithms and traveling salesman problems

By Chatterjee S. Carrera C. Lynch L.A.

European Journal of Operational Research, Vol. 93, Iss. 3, 1996-09 ,pp. : 490-510

Elsevier

Access to resources Recommend Favorite

Solving constrained traveling salesman problems by genetic algorithms*

By Wu Chunguo Liang Yanchun Lee Heowpueh Lu Chun Lin Wuzhong

Progress in Natural Science, Vol. 14, Iss. 7, 2004-07 ,pp. : 631-637

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving traveling salesman problems by genetic algorithms*

By Liang Yanchun Ge Hongwei Zhou Chunguang Lee Heow Pueh Lin Wuzhong Lim Siak Piang Lee Kwok Hong

Progress in Natural Science, Vol. 13, Iss. 2, 2003-02 ,pp. : 135-141

Taylor & Francis Ltd

Access to resources Recommend Favorite

An efficient composite heuristic for the symmetric generalized traveling salesman problem

By Renaud J. Boctor F.F.

European Journal of Operational Research, Vol. 108, Iss. 3, 1998-08 ,pp. : 571-584

Elsevier

Access to resources Recommend Favorite