Approximation for combinatorial network optimisation using Tsallis entropy

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 to the case of Tsallis entropy and provides mathematical proof.

Saved in:
Bibliographic Details
Published in:Electronics letters 2013-07, Vol.49 (14), p.1-1
Main Authors: Liao, Shengbin, Zhang, Qingfu
Format: Article
Language:English
Subjects:
Approximation
Combinatorial analysis
Entropy
Entropy (Information)
Functions (mathematics)
Mathematical analysis
Networks
Optimization
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 to the case of Tsallis entropy and provides mathematical proof.
ISSN:0013-5194
1350-911X