Little, John D.C.; Murty, Katta G.; Sweeney, Dura W.; Karel, Caroline
November 1963
Operations Research;Nov/Dec63, Vol. 11 Issue 6, p972
Academic Journal
Describes an algorithm for the traveling salesman problem. Breaking of the set of all tours into increasingly small subsets by a procedure called branching; Calculation of the lower bounds based on ideas frequently used in solving assignment problems.


Related Articles

  • Convex hull and tour crossing in the Euclidean traveling salesperson problem: Implications for human performance studies. van Roolj, Iris; Stege, Ulrike; Schactman, Alissa // Memory & Cognition;Mar2003, Vol. 31 Issue 2, p215 

    Recently there has been growing interest among psychologists in human performance on the Euclidean traveling salesperson problem (E-TSP). A debate has been initiated on what strategy people use in solving visually presented E-TSP instances. The most prominent hypothesis is the convex-hull...

  • Quantum Branch-and-Bound Algorithm and its Application to the Travelling Salesman Problem. Markevich, E. A.; Trushechkin, A. S. // Journal of Mathematical Sciences;Aug2019, Vol. 241 Issue 2, p168 

    We propose a quantum branch-and-bound algorithm based on the general scheme of the branch-and-bound method and the quantum nested searching algorithm and examine its computational efficiency. We also compare this algorithm with a similar classical algorithm on the example of the travelling...

  • EDITORIAL. Ruiz-Vanoye, Jorge A. // International Journal of Combinatorial Optimization Problems & I;Sep-Dec2014, Vol. 5 Issue 3, p1 

    An introduction to the journal is presented in which the editor discusses various reports published within the issue including an algorithm to solve the traveling salesman problem (TSP) adding three aspects of time, the desirable characteristics that must contain the software repositories for...

  • Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System. Yousefikhoshbakht, Majid; Malekzadeh, Nasrin; Sedighpour, Mohammad // International Journal of Production Management & Engineering;Jul-Dec2016, Vol. 4 Issue 2, p65 

    The TSP is considered one of the most well-known combinatorial optimization tasks and researchers have paid so much attention to the TSP for many years. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the...

  • Route Optimization of Automated Warehouse with the Aid of Modified Genetic Algorithms (MGA). Vangeri, Ashokkumar; Hebbal, S. S. // International Review of Mechanical Engineering;Jul2014, Vol. 8 Issue 4, p667 

    An important issue faced by many of the organizations, nowadays, is "delivering the product to customers within a short interval of time". An automated warehouse optimization is adopted for providing a proof of concept, test warehoused performances with different throughput, optimized layout and...

  • Harmony Search for finding the Best Hamiltony Tour in Iran. Emadi, Seyyed Peyman; Maleki, Hamid; Honari, Mina // GSTF Journal on Computing;2011, Vol. 1 Issue 2, p239 

    Traveler Salesman Problem is one of the most important and application problems in the combination optimization district that transportation usage allocate the most important place to itself among practical. Since the success of problem solution represent its power of usage into the different...

  • Algorithm of the approximate solution for the traveling salesman problem. Tovstik, Tatiana M.; Zhukova, Ekaterina V. // Vestnik Sankt-Peterburgskogo universiteta, Seriia 7: Geologia, G;2013, Issue 1, p101 

    The traveling salesman problem is studied. For its approximate solution the algorithm of construction of the good initial approximation is proposed. The initial points are reflected into a unit square. The polar co-ordinates r, φ with the origin in the square center are introduced, and in...

  • On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean... Moscato, Pablo; Norman, Michael G. // INFORMS Journal on Computing;Spring98, Vol. 10 Issue 2, p121 

    Presents a method for analyzing the Euclidean Traveling Salesman Problem (TSP) heuristics by using infinite-sized fractal instances. Definition of fractals; Generation of fractal-derived instances through a small recursive program; Construction of several fractal TSP; Use of a microscopic...

  • Solving the Orienteering Problem through Branch-and-Cut. Fischetti, Matteo; Gonzalez, Juan Jose Salazar; Toth, Paolo // INFORMS Journal on Computing;Spring98, Vol. 10 Issue 2, p133 

    Evaluates a branch-and-cut algorithm for finding an optimal solution to the Orienteering Problem. Families of valid inequalities as basis of the algorithm; Introduction of a family of cuts; Description of exact and heuristic separation algorithms; Analysis of a routing problem related to the...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics