DocumentCode
33112
Title
Approximation for combinatorial network optimisation using Tsallis entropy
Author
Shengbin Liao ; Qingfu Zhang
Author_Institution
Eng. Centre, Huazhong Normal Univ., Wuhan, China
Volume
49
Issue
14
fYear
2013
fDate
July 4 2013
Firstpage
882
Lastpage
884
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.
Keywords
combinatorial mathematics; entropy; optimisation; Shannon entropy; Tsallis entropy; combinatorial network optimisation;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el.2013.0830
Filename
6557254
Link To Document