A spatial branch-and-bound algorithm for some unconstrained single-facility location problems
Richard H. Edahl
Carnegie Mellon University.Engineering Design Research Center.
10.1184/R1/6476711.v1
https://kilthub.cmu.edu/articles/journal_contribution/A_spatial_branch-and-bound_algorithm_for_some_unconstrained_single-facility_location_problems/6476711
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to be useful on several unconstrained single-facility location problems. These include the min-sum, min-max, and max-min problems with cost functions that are continuous and non-decreasing in distance. For the special case of the min-sum problem with Euclidean metric and power cost functions, a quadratic lower-bounding function is developed that results in a convergence rate superior to that of using a simple lower bounding function from the Big Square-Small Square algorithm of Hansen et al."
1989-01-01 00:00:00
Mathematical optimization.
Branch and bound algorithms.