Solving general continuous single facility location problems by cutting planes

1987 ◽  
Vol 29 (1) ◽  
pp. 98-110 ◽  
Author(s):  
Frank Plastria
2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Lev A. Kazakovtsev ◽  
Predrag S. Stanimirović ◽  
Idowu A. Osinuga ◽  
Mikhail N. Gudyma ◽  
Alexander N. Antamoshkin

This paper describes four mathematical models for the single-facility location problems based on four special distance metrics and algorithms for solving such problems. In this study, algorithms of solving Weber problems using four distance predicting functions (DPFs) are proposed in accordance with four strategies for manipulator control. A numerical example is presented in this proposal as an analytical proof of the optimality of their results.


Networks ◽  
2016 ◽  
Vol 68 (4) ◽  
pp. 271-282 ◽  
Author(s):  
Zvi Drezner ◽  
Carlton H. Scott ◽  
John Turner

Sign in / Sign up

Export Citation Format

Share Document