An O(mn2) algorithm for the Maximin problem in E2

Authors:
Emanuel Melachrinoudis;J.Macgregor Smith
Affiliations:
Department of Mechanical, Industrial and Manufacturing Engineering, 330 Snell Engineering Center, Room 375 SN, Northeastern University, Boston, MA 02115, USA;Department of Industrial Engineering and Operations Research, University of Massachusetts, Amherst, MA 01003, USA
Venue:
Operations Research Letters
Year:
1995

Citing 4
Cited 4

Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
Computational geometry.

Computational geometry.
Closest-point problems

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
On choosing a dense subgraph

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

Semi-obnoxious single facility location in Euclidean space

Computers and Operations Research
A general model for the undesirable single facility location problem

Operations Research Letters
Locating two obnoxious facilities using the weighted maximin criterion

Operations Research Letters
Computing an obnoxious anchored segment

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

An O(mn^2) algorithm is developed in this paper for the Euclidean weighted Maximin problem using the weighted Voronoi diagram in the plane.