Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem

Author： Bockenhauer H.-J.   Hromkovic J.   Klasing R.   Seibert S.   Unger W.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.285, Iss.1, 2002-08, pp. : 3-24

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

Discrete optimization by optimal control methods. II. The static traveling salesman problem

By Sergeev S.  

Automation and Remote Control, Vol. 67, Iss. 6, 2006-06 ,pp. : 927-932

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A Hybrid Particle Swarm Optimization Method for Traveling Salesman Problem

By  

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 8, Iss. 3, 2017-07 ,pp. : 53-65

IGI Global_journal

Access to resources Recommend Favorite

GENI Ants for the Traveling Salesman Problem

By Le Louarn François-Xavier   Gendreau Michel   Potvin Jean-Yves  

Annals of Operations Research, Vol. 131, Iss. 1-4, 2004-10 ,pp. : 187-201

Springer Publishing Company

Access to resources Recommend Favorite

Dynamics of Local Search Trajectory in Traveling Salesman Problem

By Li Weiqi  

Journal of Heuristics, Vol. 11, Iss. 5-6, 2005-12 ,pp. : 507-524

Springer Publishing Company

Access to resources Recommend Favorite

A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem

By Buriol Luciana   França Paulo M.   Moscato Pablo  

Journal of Heuristics, Vol. 10, Iss. 5, 2004-09 ,pp. : 483-506

Springer Publishing Company

Access to resources Recommend Favorite