The General Facility Location Problem with Connectivity on Trees

The General Facility Location Problem with Connectivity on Trees

In this note we study the general facility location problem with connectivity. We present an O（np2）-time algorithm for the general facility location problem with connectivity on trees. Furthermore,we present an O（np）-time algorithm for the general facility location problem with connectivity on equiv...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Acta mathematica Sinica. English series 2016-09, Vol.32 (9), p.1106-1112
Hauptverfasser: Shan, Er Fang, Kang, Li Ying
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Connectivity
Equivalence
Graphs
Location analysis
Mathematical models
Mathematics
Mathematics and Statistics
Operations research
Site selection
Studies
Theorems
Trees
二进制树
时间算法
设施
连通性
选址问题
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this note we study the general facility location problem with connectivity. We present an O（np2）-time algorithm for the general facility location problem with connectivity on trees. Furthermore,we present an O（np）-time algorithm for the general facility location problem with connectivity on equivalent binary trees.
ISSN:1439-8516
1439-7617
DOI:10.1007/s10114-016-4715-0