Polyhedral results and a Branch-and-cut algorithm for the [TEX equation: k] -cardinality tree problem

By Simonetti Luidi   Cunha Alexandre   Lucena Abilio  

Mathematical Programming, Vol. 142, Iss. 1-2, 2013-12 ,pp. : 511-538

Elsevier

Access to resources Recommend Favorite

A branch‐and‐cut algorithm for the multi‐vehicle traveling purchaser problem with pairwise incompatibility constraints

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 2, 2015-03 ,pp. : 139-154

John Wiley & Sons Inc

Access to resources Recommend Favorite

A Branch-and-Cut Algorithm for the Median-Path Problem

By Avella Pasquale   Boccia Maurizio   Sforza Antonio   Vasil'Ev Igor  

Computational Optimization and Applications, Vol. 32, Iss. 3, 2005-12 ,pp. : 215-230

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

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

By Marinakis Yannis   Migdalas Athanasios   Pardalos Panos  

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

Springer Publishing Company

Access to resources Recommend Favorite