Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem

Operations Research ◽

10.1287/opre.21.1.340 ◽

1973 ◽

Vol 21 (1) ◽

pp. 340-343 ◽

Author(s):

Robert S. Garfinkel

Keyword(s):

Traveling Salesman Problem ◽

Branch And Bound ◽

Technical Note ◽

Traveling Salesman ◽

Branch And Bound Algorithm ◽

Feasible Set ◽

Asymmetric Traveling Salesman Problem

Download Full-text

A Java Implementation of the Branch and Bound Algorithm: The Asymmetric Traveling Salesman Problem.

The Journal of Object Technology ◽

10.5381/jot.2005.4.1.a5 ◽

2005 ◽

Vol 4 (1) ◽

pp. 155

Author(s):

Pawel Kalczynski

Keyword(s):

Traveling Salesman Problem ◽

Branch And Bound ◽

Traveling Salesman ◽

Branch And Bound Algorithm ◽

Asymmetric Traveling Salesman Problem

Download Full-text

Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem

Operations Research Letters ◽

10.1016/0167-6377(89)90038-2 ◽

1989 ◽

Vol 8 (3) ◽

pp. 129-135 ◽

Author(s):

D.L. Miller ◽

J.F. Pekny

Keyword(s):

Traveling Salesman Problem ◽

Branch And Bound ◽

Traveling Salesman ◽

Branch And Bound Algorithm ◽

Asymmetric Traveling Salesman Problem ◽

Parallel Branch And Bound

Download Full-text

A Study of Branch-and-Bound on the Asymmetric Traveling Salesman Problem

State-Space Search ◽

10.1007/978-1-4612-1538-7_6 ◽

1999 ◽

pp. 92-116

Author(s):

Weixiong Zhang

Keyword(s):

Traveling Salesman Problem ◽

Branch And Bound ◽

Traveling Salesman ◽

Asymmetric Traveling Salesman Problem

Download Full-text

An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading

INFOR Information Systems and Operational Research ◽

10.3138/infor.45.4.223 ◽

2007 ◽

Vol 45 (4) ◽

pp. 223-238 ◽

Author(s):

Francesco Carrabs ◽

Raffaele Cerulli ◽

Jean-François Cordeau

Keyword(s):

Traveling Salesman Problem ◽

Branch And Bound ◽

Traveling Salesman ◽

Branch And Bound Algorithm ◽

Pickup And Delivery

Download Full-text

Comparative Analysis of the Branch and Bound Method Combinations with Metaheuristic Algorithms for Solving the Asymmetric Traveling Salesman Problem

INFORMACIONNYE TEHNOLOGII ◽

10.17587/it.25.590-595 ◽

2019 ◽

Vol 25 (10) ◽

pp. 590-595

Author(s):

M. V. Ulyanov ◽

◽

M. I. Fomichev ◽

◽

Keyword(s):

Comparative Analysis ◽

Traveling Salesman Problem ◽

Branch And Bound ◽

Traveling Salesman ◽

Metaheuristic Algorithms ◽

Branch And Bound Method ◽

Asymmetric Traveling Salesman Problem

Download Full-text

Approaches to Design Search Decision Tree in the Branch and Bound Method for the Asymmetric Traveling Salesman Problem

INFORMACIONNYE TEHNOLOGII ◽

10.17587/it.24.698-704 ◽

2018 ◽

Vol 24 (11) ◽

pp. 698-704

Author(s):

M. V. Ulyanov ◽

◽

M. I. Fomichev ◽

Keyword(s):

Decision Tree ◽

Traveling Salesman Problem ◽

Branch And Bound ◽

Traveling Salesman ◽

Branch And Bound Method ◽

Asymmetric Traveling Salesman Problem

Download Full-text

An Exact Two-Matching Based Branch and Bound Algorithm for the Symmetric Traveling Salesman Problem

10.21236/ada237878 ◽

1991 ◽

Author(s):

D. L. Miller ◽

J. F. Pekny ◽

G. L. Thompson

Keyword(s):

Traveling Salesman Problem ◽

Branch And Bound ◽

Traveling Salesman ◽

Branch And Bound Algorithm ◽

Symmetric Traveling Salesman Problem

Download Full-text

A branch and bound algorithm for the porbabilistic traveling salesman problem

2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) ◽

10.1109/snpd.2015.7176284 ◽

2015 ◽

Author(s):

Soumaya Sassi Mahfoudh ◽

Walid Khaznaji ◽

Monia Bellalouna

Keyword(s):

Traveling Salesman Problem ◽

Branch And Bound ◽

Traveling Salesman ◽

Branch And Bound Algorithm

Download Full-text

A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation

European Journal of Operational Research ◽

10.1016/0377-2217(82)90015-7 ◽

1982 ◽

Vol 9 (1) ◽

pp. 83-89 ◽

Author(s):

Ton Volgenant ◽

Roy Jonker

Keyword(s):

Traveling Salesman Problem ◽

Branch And Bound ◽

Traveling Salesman ◽

Branch And Bound Algorithm ◽

Symmetric Traveling Salesman Problem

Download Full-text

Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network

Proceedings of 9th International Parallel Processing Symposium ◽

10.1109/ipps.1995.395930 ◽

2002 ◽

Author(s):

S. Tschoke ◽

R. Lubling ◽

B. Monien

Keyword(s):

Traveling Salesman Problem ◽

Branch And Bound ◽

Traveling Salesman ◽

Branch And Bound Algorithm ◽

The Traveling Salesman Problem

Download Full-text