A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem

Author： M F A

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.81, Iss.1, 1998-01, pp. : 289-306

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

Nonlinear resolving functions for the travelling salesman problem

By Sergeev S.

Automation and Remote Control, Vol. 74, Iss. 6, 2013-06 ,pp. : 978-994

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Hybrid ABC/PSO to solve travelling salesman problem

By Yang Weihong Pei Zhili

International Journal of Computing Science and Mathematics, Vol. 4, Iss. 3, 2013-10 ,pp. : 214-221

Inderscience Publishers

Access to resources Recommend Favorite

Solving Travelling Salesman Problem Using Heart Algorithm

International Journal of Applied Evolutionary Computation (IJAEC), Vol. 8, Iss. 4, 2017-10 ,pp. : 32-42

IGI Global_journal

Access to resources Recommend Favorite

On the prize-collecting generalized minimum spanning tree problem

By Pop P.

Annals of Operations Research, Vol. 150, Iss. 1, 2007-03 ,pp. : 193-204

Springer Publishing Company

Access to resources Recommend Favorite

Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators

By Larrañaga P. Kuijpers C.M.H. Murga R.H. Inza I. Dizdarevic S.

Artificial Intelligence Review, Vol. 13, Iss. 2, 1999-04 ,pp. : 129-170

Springer Publishing Company

Access to resources Recommend Favorite