Approximation for combinatorial network optimisation using Tsallis entropy

Approximation for combinatorial network optimisation using Tsallis entropy

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.


    1. 1)
      • 1. Minghua, C., Soung, L., Ziyu, S., Caihong, K.: ‘Markov approximation for combinatorial network optimization’. Proc. Infocom, 2010, pp. 19.
    2. 2)
      • 2. Constantino, T.: ‘Possible generalization of Boltzmaan–Gibbs statistics’, J. Stat. Phys., 1988, 52, pp. 479487 (doi: 10.1007/BF01016429).
    3. 3)
      • 3. Sabir, U., Constantino, T., Stanly, S.: ‘On a q-central limit theorem consistent with non-extensive statistical mechanics’, Milan J. Math., 2008, 76, pp. 307328 (doi: 10.1007/s00032-008-0087-y).
    4. 4)
      • 4. Boyd, S., Vandenberghe, L.: ‘Convex optimization’ (Cambridge University Press, 2004).
    5. 5)
      • 5. Christian, B.: ‘Generalised information and entropy measures in physics’, Contemp. Phys., 2009, 50, pp. 495510 (doi: 10.1080/00107510902823517).

Related content

This is a required field
Please enter a valid email address