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.
| Original language | English |
|---|---|
| Pages (from-to) | 882-883 |
| Journal | Electronics Letters |
| Volume | 49 |
| Issue number | 14 |
| DOIs | |
| Publication status | Published - 4 Jul 2013 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'Approximation for combinatorial network optimisation using Tsallis entropy'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver