Probabilistic Algorithm for the Directed Traveling Salesman Problem

DOI10.1287/MOOR.11.2.343MaRDI QIDQ3730366zbMATH OpenOpenAlexFDO

Authors J. Michael Steele

Publication date 1986

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.11.2.343

zbMATH Keywords

\(\epsilon \) -optimal probabilistic algorithmasymptotic behavioroptimal solutionpolynomial timerandom directed traveling salesman problem

Mathematics Subject Classification ID

Stochastic programming (90C15) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 808804
• scientific article; zbMATH DE number 3936510
• scientific article; zbMATH DE number 3932819
• scientific article; zbMATH DE number 706869
• Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded from above instances

Cited in

(6)

• Limit theory of combinatorial optimization for random geometric graphs
• Aggregation for the probabilistic traveling salesman problem
• Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded from above instances
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• An asymptotically optimal algorithm for the m-peripatetic salesman problem on random inputs with discrete distribution
• Some new families of KP-digraphs

This page was built for publication: Probabilistic Algorithm for the Directed Traveling Salesman Problem

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