An Algorithm for the Traveling Salesman Problem

DOI10.1287/opre.11.6.972zbMath0161.39305WikidataQ56271119 ScholiaQ56271119MaRDI QIDQ5543949

John Little, Katta G. Murty, D. W. Sweeney, C. Karel

Publication date: 1963

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.11.6.972

zbMATH Keywords

operations research

Related Items

Trivial integer programs unsolvable by branch-and-bound, Optimal expansion of an existing network, Unnamed Item, Auction-based approach to resolve the scheduling problem in the steel making process, Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben, Routing order pickers in a warehouse with a middle aisle, Probabilistic subproblem selection in branch-and-bound algorithms, An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem, A diagonal completion and 2-optimal procedure for the travelling salesman problem, An improved branch and bound algorithm for minimum concave cost network flow problems, The symmetric clustered traveling salesman problem, Dynamic programming and board games: a survey, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations, The use of state space relaxation for the dynamic facility location problem, The optimum assignments and a new heuristic approach for the traveling salesman problem, An algorithm for the traveling salesman problem with pickup and delivery customers, An upper bound for the speedup of parallel best-bound branch-and-bound algorithms, The facility layout problem, Branch-and-bound and parallel computation: A historical note, Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem, Time-cost tradeoff in a three-dimensional assignment problem, Multiple and bicriteria scheduling: A literature survey, Multiobjective network scheduling with efficient use of renewable and nonrenewable resources, Heuristics and their design: A survey, A survey of scheduling methods for multiprocessor systems, A branch and bound algorithm for minimizing the expected cost of testing coherent systems, A heuristic procedure for solving the quadratic assignment problem, Probabilistic analysis of solving the assignment problem for the traveling salesman problem, Reducing reexpansions in iterative-deepening search by controlling cutoff bounds, The traveling salesman problem: An overview of exact and approximate algorithms, A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems, An approach for solving a class of transportation scheduling problems, The seriation problem and the travelling salesman problem, A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer, Procedures for travelling salesman problems with additional constraints, A characterization of linear admissible transformations for the m- travelling salesmen problem, Computational comparison on the partitioning strategies in multiple choice integer programming, A branch and bound algorithm for the traveling purchaser problem, An empirical study of a new metaheuristic for the traveling salesman problem, Efficiency considerations in the implementation of parallel branch-and- bound, Set-up saving schemes for printed circuit boards assembly, A two-dimensional mapping for the traveling salesman problem, The heuristic search under conditions of error, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem, A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem, The traveling salesman problem with backhauls, An efficient envelope-based branch and bound algorithm for non-convex combined heat and power production planning, A planning and scheduling model for onsertion in printed circuit board assembly, Avoiding spurious submovement decompositions. II: A scattershot algorithm, A new approach to solving the multiple traveling salesperson problem using genetic algorithms, Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems, The travelling salesman problem with precedence constraints., A travelling salesman problem (TSP) with multiple job facilities., Optimality conditions to the acyclic travelling salesman problem., Time-dependent travelling salesman problem., Heuristically guided search and chromosome matching, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS, Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems, A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM, An integer programming application to solve sequencer mix problems in printed circuit board production, Recursive branch and bound, A MILP model for then-job,M-stage flowshop with sequence dependent set-up times, Order batching algorithms and travel-time estimation for automated storage/retrieval systems, Integer programming approaches to the travelling salesman problem, Personnel assignment by multiobjective programming, Implementing vehicle routing algorithms, A continuous variable representation of the traveling salesman problem, Preventing redundant solutions in partial enumeration algorithms