Solving a maximin location problem on the plane with given accuracy-Reference-Cited by-同舟云学术

Solving a maximin location problem on the plane with given accuracy

Published:2014-07 Issue:7 Volume:75 Page:1221-1230
ISSN:0005-1179
Container-title:Automation and Remote Control
language:en
Short-container-title:Autom Remote Control

Author:

Zabudskii G. G.,Koval’ A. A.

Publisher

Pleiades Publishing Ltd

Subject

Control and Systems Engineering,Electrical and Electronic Engineering

Link

http://link.springer.com/content/pdf/10.1134/S0005117914070042.pdf

Reference18 articles.

1. Beresnev, V.L., Diskretnye zadachi razmeshcheniya i polinomy ot bulevykh peremennykh (Discrete Location Problems and Polynomials of Boolean Variables), Novosibirsk: Inst. Mat. Sib. Otd. Ross. Akad. Nauk, 2005.

2. Panyukov, A.V. and Pelzwerger, B.V., Optimal Location of a Tree in a Finite Set, Zh. Vychisl. Mat. Mat. Fiz., 1988, vol. 28, pp. 618–620.

3. Panyukov, A.V. and Pelzwerger, B.V., Polynomial Algorithms to Finite Veber Problem for a Tree Network, J. Comput. Appl. Math., 1991, vol. 35, pp. 291–296.

4. Ageev, A.A., Gimadi, E.Kh., and Kurochkin, A.A., A Polynomial Algorithm for the Location Problem on a Chain with Identical Industrial Capacities of Plants, Diskret. Anal. Issled. Oper., 2009, vol. 16, no. 5, pp. 3–18.

5. Zabudskii, G.G., Model Building and Location Problem Solving in a Plane with Forbidden Gaps, Autom. Remote Control, 2006, vol. 67, no. 12, pp. 1986–1990.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Existence of an Integer Solution of the Relaxed Weber Problem for a Tree Network;Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software";2019

2. Optimal placement of rectangles on a plane with fixed objects;Automation and Remote Control;2017-09