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

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Electronics letters 2013-07, Vol.49 (14), p.882-884
Hauptverfasser:	Liao, Shengbin, Zhang, Qingfu
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences combinatorial mathematics combinatorial network optimisation entropy Exact sciences and technology Information and communications Information theory Information, signal and communications theory Logic and foundations Mathematical logic, foundations, set theory Mathematics optimisation Proof theory and constructive mathematics Sciences and techniques of general use Shannon entropy Telecommunications and information theory Tsallis entropy
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0013-5194 1350-911X 1350-911X
DOI:	10.1049/el.2013.0830