The Traveling Salesman Problem: A Survey

DOI10.1287/OPRE.16.3.538MaRDI QIDQ5615771zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mandell Bellmore, G. L. Nemhauser

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

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

Cited in

(57)

• The optimum assignments and a new heuristic approach for the traveling salesman problem
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• An algorithm for the traveling salesman problem with pickup and delivery customers
• A geometric problem involving the nearest neighbour algorithm
• 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
• Operational estimators for the length of a traveling salesman tour
• Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
• Integer programming formulation of combinatorial optimization problems
• On the solutions of stochastic traveling salesman problems
• An approach for solving a class of transportation scheduling problems
• The seriation problem and the travelling salesman problem
• Scheduling in a sequence dependent setup environment with genetic search
• A multisolution method for cell formation---exploring practical alternatives in group technology manufacturing
• The traveling purchaser problem and its variants
• Determination of optimal path under approach and exit constraints
• Planning a multi-sensors search for a moving target considering traveling costs
• Time window optimization for attended home service delivery under multiple sources of uncertainties
• An exact method for scheduling a yard crane
• Multiheuristic approach to discrete optimization problems
• Particle swarm optimization-based algorithms for TSP and generalized TSP
• Time-dependent travelling salesman problem.
• Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem
• Strategies for generating well centered tetrahedral meshes on industrial geometries
• The travelling salesman problem: selected algorithms and heuristics†
• Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems
• COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS
• A multi-agent approach for solving traveling salesman problem
• A comparative study of task assignment and path planning methods for multi-UGV missions
• A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• A restricted Lagrangean approach to the traveling salesman problem
• On the resources allocation problem
• The travelling salesman problem and a class of polyhedra of diameter two
• Integer programming approaches to the travelling salesman problem
• Lineare Charakterisierungen von Travelling Salesman Problemen
• Some theoretical implications of local optimization
• The zero pivot phenomenon in transportation and assignment problems and its computational implications
• A Simultaneous Enumeration Approach to the Traveling Salesman Problem
• The adjacency relation on the traveling salesman polytope is NP-Complete
• A continuous variable representation of the traveling 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
• Biogeography migration algorithm for traveling salesman problem
• On the nearest-neighbor algorithm for the mean-field traveling salesman problem
• Some problems in discrete optimization
• Some constrained shortest-route problems
• The traveling-salesman problem and minimum spanning trees: Part II
• An implicit enumeration program for zero-one integer programming
• An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem
• Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising
• Heuristic approaches for the family traveling salesman problem
• Heuristics for a cash-collection routing problem with a cluster-first route-second approach
• A faster heuristic for the traveling salesman problem with drone
• On single courier problem
• Truncated \(M\)-travelling salesman problem

This page was built for publication: The Traveling Salesman Problem: A Survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5615771)