z-logo
open-access-imgOpen Access
Approximation for combinatorial network optimisation using Tsallis entropy
Author(s) -
Liao Shengbin,
Zhang Qingfu
Publication year - 2013
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2013.0830
Subject(s) - tsallis entropy , entropy (arrow of time) , mathematics , statistical physics , binary entropy function , rényi entropy , principle of maximum entropy , computer science , mathematical optimization , tsallis statistics , statistics , physics , thermodynamics
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here