Similar Search Results

Narrow search

An algorithm for the bottleneck traveling salesman problem

Carpaneto, Giorgio; Martello, Silvano; Toth, Paolo - In: Operations research 32 (1984) 2, pp. 380-389

Persistent link: https://www.econbiz.de/10003509862

Some new branching and bounding criteria for the asymmetric travelling salesman problem

Carpaneto, Giorgio; Toth, Paolo - In: Management science : journal of the Institute for … 26 (1980) 7, pp. 736-743

Persistent link: https://www.econbiz.de/10003509867

A new algorithm for the travelling salesman problem with duedates

Carpaneto, Giorgio; Toth, Paolo - In: Advances in operations research : proceedings of EURO …, (pp. 95-102). 1977

Persistent link: https://www.econbiz.de/10001975308

Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem

Carpaneto, Giorgio; Toth, Paolo - In: Management Science 26 (1980) 7, pp. 736-743

Many algorithms have been developed for the optimal solution of the asymmetric travelling salesman problem: the most efficient ones are based on the subtour elimination approach. This paper presents a breadth-first branch and bound algorithm which differs from the method of Smith, Srinivasan and...

Persistent link: https://www.econbiz.de/10009191510

Erratum to "Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem"

Carpaneto, Giorgio; Toth, Paolo - In: Management Science 27 (1981) 9, pp. 1093-1093

Erratum to Carpaneto, Giorgio, Paolo Toth. 1980. Branching and bounding criteria for the asymmetric travelling salesman problem. Management Sci. 26 (7) 736--743.

Persistent link: https://www.econbiz.de/10009197941