7 citations to 10.1016/0377-0427(91)90215-6 (Crossref Cited-By Service)

1. A. V. Panyukov, “On the Existence of an Integer Solution to the Relaxed Weber Problem for a Tree Network”, Autom Remote Control, 80, № 7, 2019, 1288  
2. A. V. Panyukov, R. E. Shangin, “Algorithm for the discrete Weber’s problem with an accuracy estimate”, Autom Remote Control, 77, № 7, 2016, 1208  
3. A.V. Panyukov, “Relaxational Polyhedron of Veber Problem”, IFAC Proceedings Volumes, 31, № 13, 1998, 187  
4. Anatoly Panyukov, “Polynomial solvability of NP-complete problems”, ScienceOpen Research, 2014  
5. A.V. Panyukov, “On the Existence of an Integer Solution of the Relaxed Weber Problem for a Tree Network”, Bulletin of the SUSU. MMP, 12, № 1, 2019, 150  
6. G. G. Zabudskii, A. A. Koval’, “Solving a maximin location problem on the plane with given accuracy”, Autom Remote Control, 75, № 7, 2014, 1221  
7. A. V. Panyukov, “The Steiner Problem in Graphs: Topological Methods of Solution”, Automation and Remote Control, 65, № 3, 2004, 439