Asymptotic properties of combinatorial optimization problems in \(p\)-adic space
From MaRDI portal
Publication:1760265
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)
travelling salesman problem; minimum spanning tree; stochastic combinatorial optimization; \(p\)-adic space
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item