A Hybrid Genetic—GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem

Author： Marinakis Yannis   Migdalas Athanasios   Pardalos Panos  

Publisher： Springer Publishing Company

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.10, Iss.4, 2005-12, pp. : 311-326

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

Expanding Neighborhood GRASP for the Traveling Salesman Problem

By Marinakis Yannis   Migdalas Athanasios   Pardalos Panos  

Computational Optimization and Applications, Vol. 32, Iss. 3, 2005-12 ,pp. : 231-257

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

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

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

Lagrangean relaxation-based algorithm for bi-level problems

By Rahmani A.   MirHassani S.A.  

Optimization Methods and Software, Vol. 30, Iss. 1, 2015-01 ,pp. : 1-14

Taylor & Francis Ltd

Access to resources Recommend Favorite