The travelling salesman problem with neighbourhoods: MINLP solution

Author： Gentilini Iacopo   Margot François   Shimada Kenji  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.28, Iss.2, 2013-04, pp. : 364-378

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

A bilevel programming approach to the travelling salesman problem

By Marcotte P.   Savard G.   Semet F.  

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 240-248

Elsevier

Access to resources Recommend Favorite

New Imperialist Competitive Algorithm to solve the travelling salesman problem

By Yousefikhoshbakht Majid  

International Journal of Computer Mathematics, Vol. 90, Iss. 7, 2013-07 ,pp. : 1495-1505

Taylor & Francis Ltd

Access to resources Recommend Favorite

Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

By Mak Vicky   Thomadsen Tommy  

Journal of Combinatorial Optimization, Vol. 11, Iss. 4, 2006-06 ,pp. : 421-434

Springer Publishing Company

Access to resources Recommend Favorite

New MINLP formulation for the multiperiod pooling problem

By  

AICHE JOURNAL, Vol. 61, Iss. 11, 2015-11 ,pp. : 3728-3738

John Wiley & Sons Inc

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