Approximation for combinatorial network optimisation using Tsallis entropy
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 882-883 |
| Journal / Publication | Electronics Letters |
| Volume | 49 |
| Issue number | 14 |
| Publication status | Published - 4 Jul 2013 |
| Externally published | Yes |
Link(s)
Abstract
Recent research shows that a combinatorial network optimisation problem can be approximated by adding a Shannon entropy term to its objective function. This Letter generalises it to the case of Tsallis entropy and provides the mathematical proof.
Citation Format(s)
Approximation for combinatorial network optimisation using Tsallis entropy. / Liao, Shengbin; Zhang, Qingfu.
In: Electronics Letters, Vol. 49, No. 14, 04.07.2013, p. 882-883.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
