A statistical approach to the tsp

DOI10.1002/NET.3230070303zbMATH Open0398.90103OpenAlexW1979437687MaRDI QIDQ4182284FDOQ4182284

Authors: Bruce Golden 

Publication date: 1977

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230070303

zbMATH Keywords

HeuristicTraveling Salesman ProblemStatistical ApproachRandomly Generated Networks

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Title not available (Why is that?)
• Computer Solutions of the Traveling Salesman Problem
• Implementing vehicle routing algorithms
• A man-machine approach toward solving the traveling salesman problem
• Title not available (Why is that?)

Cited In (12)

• Randomized algorithms in combinatorial optimization: A survey
• Heuristic methods and applications: A categorized survey
• A heuristic approximation of the worst case of Shellsort
• A computational evaluation of optimal solution value estimation procedures
• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
• Continuous approximation formulas for location problems
• Dividing a territory among several vehicles
• Point estimation of a global optimum for large combinatorial problems
• Probabilistic analysis of solving the assignment problem for the traveling salesman problem
• Semi-greedy heuristics: An empirical study
• Approximation algorithms with constant ratio for general cluster routing problems

This page was built for publication: A statistical approach to the tsp

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