A man-machine approach toward solving the traveling salesman problem
From MaRDI portal
Publication:5621270
DOI10.1145/362588.362593zbMath0217.27302OpenAlexW1992928037MaRDI QIDQ5621270
W. Felts, P. D. Krolak, George Marble
Publication date: 1971
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/362588.362593
Related Items
Experimentation in optimization, A heuristic for large-size \(p\)-median location problems with application to school location, Tabu search performance on the symmetric travelling salesman problem, Solving the max-cut problem using eigenvalues, ALTO: A computer system for the design of vehicle routing algorithms, Genetic algorithms for the traveling salesman problem, A learning based algorithm for drone routing, Discrete extremal problems, A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem, Accelerated branch exchange heuristics for symmetric traveling salesman problems, A projection method for the uncapacitated facility location problem, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, Facet identification for the symmetric traveling salesman polytope, A method for solving to optimality uncapacitated location problems, An additive bounding procedure for the asymmetric travelling salesman problem, A note on the effect of neighborhood structure in simulated annealing, On solving the discrete location problems when the facilities are prone to failure, Optimization with neural networks: A recipe for improving convergence and solution quality, A diagonal completion and 2-optimal procedure for the travelling salesman problem, Multi stage Monte Carlo optimization applied to a six hundred point travelling salesman problem, Interval estimation of a global optimum for large combinatorial problems, A statistical approach to the tsp, Future paths for integer programming and links to artificial intelligence, A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem, An ex-post bound on the greedy heuristic for the uncapacitated facility location problem, An empirical study of a new metaheuristic for the traveling salesman problem, The traveling salesman problem: An update of research, An improved assignment lower bound for the Euclidean traveling salesman problem, Solution of large-scale symmetric travelling salesman problems, 'Multidimensional' extensions and a nested dual approach for the m-median problem, A Primal Approach to the Simple Plant Location Problem
