Pages that link to "Item:Q5621270"

The following pages link to A man-machine approach toward solving the traveling salesman problem (Q5621270):

Displaying 31 items.

• A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
• Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
• A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
• A projection method for the uncapacitated facility location problem (Q918404) (← links)
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem (Q918425) (← links)
• Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
• A method for solving to optimality uncapacitated location problems (Q920004) (← links)
• An improved assignment lower bound for the Euclidean traveling salesman problem (Q1058993) (← links)
• 'Multidimensional' extensions and a nested dual approach for the m-median problem (Q1072925) (← links)
• Experimentation in optimization (Q1084342) (← links)
• ALTO: A computer system for the design of vehicle routing algorithms (Q1119169) (← links)
• Discrete extremal problems (Q1152306) (← links)
• An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
• A note on the effect of neighborhood structure in simulated annealing (Q1184445) (← links)
• Optimization with neural networks: A recipe for improving convergence and solution quality (Q1202321) (← links)
• An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
• A heuristic for large-size \(p\)-median location problems with application to school location (Q1339149) (← links)
• Tabu search performance on the symmetric travelling salesman problem (Q1342103) (← links)
• Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
• Solving the max-cut problem using eigenvalues (Q1900149) (← links)
• Genetic algorithms for the traveling salesman problem (Q1919848) (← links)
• A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
• On solving the discrete location problems when the facilities are prone to failure (Q2477339) (← links)
• A learning based algorithm for drone routing (Q2669632) (← links)
• An ex-post bound on the greedy heuristic for the uncapacitated facility location problem (Q3411298) (← links)
• The traveling salesman problem: An update of research (Q3671783) (← links)
• Accelerated branch exchange heuristics for symmetric traveling salesman problems (Q3790961) (← links)
• A Primal Approach to the Simple Plant Location Problem (Q3958238) (← links)
• Interval estimation of a global optimum for large combinatorial problems (Q4181638) (← links)
• A statistical approach to the tsp (Q4182284) (← links)
• Multi stage Monte Carlo optimization applied to a six hundred point travelling salesman problem (Q4693305) (← links)