Asymptotic properties of combinatorial optimization problems in \(p\)-adic space

DOI10.1134/S207004661102004XzbMath1279.90149MaRDI QIDQ1760265

Mukadas D. Missarov, Roman G. Stepanov

Publication date: 13 November 2012

Published in: \(p\)-Adic Numbers, Ultrametric Analysis, and Applications (Search for Journal in Brave)

zbMATH Keywords

travelling salesman problemminimum spanning treestochastic combinatorial optimization\(p\)-adic space

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (1)

\(p\)-adic mathematical physics: the first 30 years

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(p\)-adic mathematical physics
• p-adic space-time and string theory
• p-adic Feynman and string amplitudes
• Probability theory of classical Euclidean optimization problems
• Combinatorial optimization problems in ultrametric spaces
• 75.9 Euler’s Constant
• Probability and Computing

This page was built for publication: Asymptotic properties of combinatorial optimization problems in \(p\)-adic space