This article is cited in 10 papers

An algorithm for approximate solution to the Weber problem on a line with forbidden gaps

G. G. Zabudsky, N. S. Veremchuk

Omsk department of S. L. Sobolev Institute of Mathematics, SB RAS, 13 Pevtsov St., 644099 Omsk, Russia

Abstract: The location problem of interconnected facilities on a line with forbidden gaps is considered. The properties of the problem which allow the initial continuous problem to be reduced to the discrete problem are found. The approximate algorithm for solving the problem is developed and the results of computational experiments are presented. Tab. 1, bibliogr. 15.

Keywords: location problem, interconnected facilities, approximate decision.

UDC: 519.854

Received: 29.04.2015
Revised: 10.08.2015

DOI: 10.17377/daio.2016.23.489

 English version: Journal of Applied and Industrial Mathematics, 2016, 10:1, 136–144

Bibliographic databases:

• 
• 
•