Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem

Author： Toriello Alejandro  

Publisher： Elsevier

ISSN： 0025-5610

Source： Mathematical Programming, Vol.144, Iss.1-2, 2014-04, pp. : 247-264

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

Related content

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 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

Solving the dynamic traveling salesman game problem

By Belousov A.   Berdyshev Yu.   Chentsov A.   Chikrii A.  

Cybernetics and Systems Analysis, Vol. 46, Iss. 5, 2010-09 ,pp. : 718-723

Springer Publishing Company

Access to resources Recommend Favorite

New policies for the dynamic traveling salesman problem

By Ghiani Gianpaolo   Quaranta Antonella   Triki Chefi  

Optimization Methods and Software, Vol. 22, Iss. 6, 2007-12 ,pp. : 971-983

Taylor & Francis Ltd

Access to resources Recommend Favorite

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