The Planar Two-Center and Two-Median Problems

Published Online:https://doi.org/10.1287/trsc.18.4.351

We present algorithms for the solution of planar location-allocation problems with two new facilities. Euclidean distances are assumed. We address both the minimax (or “two-center”), and minisum (or “two-median”) problems. Computational results are presented.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.