| Article ID: | iaor199460 |
| Country: | Singapore |
| Volume: | 6 |
| Issue: | 2 |
| Start Page Number: | 148 |
| End Page Number: | 157 |
| Publication Date: | Nov 1989 |
| Journal: | Asia-Pacific Journal of Operational Research |
| Authors: | Chaudhuri P.K., Dutta Dulal |
This paper presents the procedures for seeking an exact solution of a constrained two-dimensional minimax location problem. The facility point is supposed to lie in a region bounded by a polyhedral set. The distance measure is Euclidean. The time complexity of the algorithm in the worst case is of