The Traveling Salesman Problem: A Survey

DOI10.1287/opre.16.3.538zbMath0213.44604OpenAlexW3118260104WikidataQ92176349 ScholiaQ92176349MaRDI QIDQ5615771

Mandell Bellmore, Nemhauser, George I.

Publication date: 1968

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

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

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

A multi-agent approach for solving traveling salesman problem, Multiheuristic approach to discrete optimization problems, Scheduling in a sequence dependent setup environment with genetic search, A geometric problem involving the nearest neighbour algorithm, Particle swarm optimization-based algorithms for TSP and generalized TSP, A MILP model for then-job,M-stage flowshop with sequence dependent set-up times, Some problems in discrete optimization, Some constrained shortest-route problems, Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries, The traveling-salesman problem and minimum spanning trees: Part II, Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising, Heuristic approaches for the family traveling salesman problem, On the resources allocation problem, Heuristics for a cash-collection routing problem with a cluster-first route-second approach, A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows, Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem, Probabilistic analysis of solving the assignment problem for the traveling salesman problem, On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem. I, An implicit enumeration program for zero-one integer programming, The travelling salesman problem and a class of polyhedra of diameter two, On single courier problem, Integer programming approaches to the travelling salesman problem, The traveling purchaser problem and its variants, Time-dependent travelling salesman problem., Biogeography migration algorithm for traveling salesman problem, On the Nearest-Neighbor Algorithm for the Mean-Field Traveling Salesman Problem, Lineare Charakterisierungen von Travelling Salesman Problemen, Some theoretical implications of local optimization, Operational estimators for the length of a traveling salesman tour, An exact method for scheduling a yard crane, The travelling salesman problem: selected algorithms and heuristics†, The zero pivot phenomenon in transportation and assignment problems and its computational implications, A Comparative Study of Task Assignment and Path Planning Methods for Multi-UGV Missions, Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient, Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems, A Simultaneous Enumeration Approach to the Traveling Salesman Problem, The adjacency relation on the traveling salesman polytope is NP-Complete, An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem, Integer programming formulation of combinatorial optimization problems, Planning a multi-sensors search for a moving target considering traveling costs, On the solutions of stochastic traveling salesman problems, Truncated \(M\)-travelling salesman problem, A continuous variable representation of the traveling salesman problem, An approach for solving a class of transportation scheduling problems, The seriation problem and the travelling salesman problem, Using cutting planes to solve the symmetric Travelling Salesman problem, Point estimation of a global optimum for large combinatorial problems, Optimierung des Schülerverkehrs durch gemischt ganzzahlige Programmierung, COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS, A restricted Lagrangean approach to the traveling salesman problem, The optimum assignments and a new heuristic approach for the traveling salesman problem, Determination of optimal path under approach and exit constraints, A multisolution method for cell formation---exploring practical alternatives in group technology manufacturing, The maximum covering/shortest path problem: A multiobjective network design and routing formulation, Time window optimization for attended home service delivery under multiple sources of uncertainties, An algorithm for the traveling salesman problem with pickup and delivery customers