On the Existence of an Integer Solution to the Relaxed Weber Problem for a Tree Network
Abstract
The problem of finding an optimal location of the vertices of a tree network in an assembly space representing a finite set is considered. The optimality criterion is the minimum total cost of location and communications in all points of this space. Different vertices of the tree can be located in a single point of the assembly space. This problem is well-known as the Weber problem. The representation of the Weber problem as a linear programming...
Paper Details
Title
On the Existence of an Integer Solution to the Relaxed Weber Problem for a Tree Network
Published Date
Jul 1, 2019
Volume
80
Issue
7
Pages
1288 - 1293
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History