On Random Symmetric Travelling Salesman Problems
From MaRDI portal
Publication:5704203
DOI10.1287/moor.1040.0105zbMath1082.05517OpenAlexW2045762410WikidataQ57401515 ScholiaQ57401515MaRDI QIDQ5704203
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1040.0105
Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Combinatorial probability (60C05)
Related Items (15)
Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles ⋮ On the longest path of a randomly weighted tournament ⋮ The mean field traveling salesman and related problems ⋮ Computing the variance of tour costs over the solution space of the TSP in polynomial time ⋮ Probabilistic analysis of optimization problems on sparse random shortest path metrics ⋮ Replica symmetry of the minimum matching ⋮ Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance ⋮ The Blind Passenger and the Assignment Problem ⋮ Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above ⋮ Random shortest paths: non-Euclidean instances for metric optimization problems ⋮ On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph ⋮ Global optima results for the Kauffman \(NK\) model ⋮ A cutting plane method for risk-constrained traveling salesman problem with random arc costs ⋮ New global optima results for the Kauffman \(NK\) model: Handling dependency ⋮ On the number ofk-cycles in the assignment problem for random matrices
This page was built for publication: On Random Symmetric Travelling Salesman Problems
