Abstract

For the Weber problem of construction of the minimal cost planar weighted network connecting four terminals with two extra facilities, the solution by radicals is proposed. The conditions for existence of the network in the assumed topology and the explicit formulae for coordinates of the facilities are presented. It is shown that the bifacility network is less costly than the unifacility one. Extension of the results to the general Weber problem is also discussed.

Original languageEnglish
Title of host publicationComputational Science and Its Applications – ICCSA 2020
Subtitle of host publication20th International Conference, Cagliari, Italy, July 1–4, 2020, Proceedings, Part III
EditorsOsvaldo Gervasi, et al.
Place of PublicationCham
PublisherSpringer Nature
Pages395-411
Number of pages17
ISBN (Print)9783030588076
DOIs
Publication statusPublished - Sep 2020
Event20th International Conference on Computational Science and Its Applications, ICCSA 2020 - Cagliari
Duration: 1 Jul 20204 Jul 2020

Publication series

NameLNCS
Volume12251
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th International Conference on Computational Science and Its Applications, ICCSA 2020
CountryItaly
CityCagliari
Period1/07/204/07/20

Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Analytics of the multifacility Weber problem'. Together they form a unique fingerprint.

Cite this