Simulated annealing construction of shortest paths on incomplete graphs
Simulated annealing construction of shortest (spanning/nonspanning
and closed/open) paths on generál connected graphs is discussed. A brief graphtheoretical analysis of the problem is given. A theorem has been proved that for connected graphs the shortest paths are semielementary, that is each edge on the path is visited at most twice in opposite directions. This observation considerably reduces t…
- Pospíchal, Jiří
- Kvasnička, Vladimír
- simulated annealing
- traveling salesman problem
- shortest paths on incomplete graphs
- model:article
- Pospíchal, Jiří
- Kvasnička, Vladimír
- simulated annealing
- traveling salesman problem
- shortest paths on incomplete graphs
- model:article
- http://creativecommons.org/publicdomain/mark/1.0/
- false
- policy:public
- Neural network world: international journal on neural and mass-parallel computing and information systems | 2003 Volume:13 | Number:3
- uuid:1da52e56-72f5-498a-8a1a-8b69033461dd
- https://cdk.lib.cas.cz/client/handle/uuid:1da52e56-72f5-498a-8a1a-8b69033461dd
- uuid:1da52e56-72f5-498a-8a1a-8b69033461dd
- bez média
- svazek
- eng
- eng
- Czech Republic
- 2021-06-01T12:19:28.026Z
- 2021-06-01T12:19:28.026Z