13 citations · 28 across the 7 of their papers we have counts for
6 papers · 1 filter
Obnoxious facility location: the case of weighted demand points
Pawel Kalczynski, Atsuo Suzuki, Zvi Drezner
The problem considered in this paper is the weighted obnoxious facility location in the convex hull of demand points. The objective function is to maximize the smallest weighted di…
Improved Starting Solutions for the Planar p-Median Problem
Jack Brimberg, Zvi Drezner
In this paper we present two new approaches for finding good starting solutions to the planar p-median problem. Both methods rely on a discrete approximation of the continuous mode…
The Importance of Good Starting Solutions in the Minimum Sum of Squares Clustering Problem
Pawel Kalczynski, Jack Brimberg, Zvi Drezner
The clustering problem has many applications in Machine Learning, Operations Research, and Statistics. We propose three algorithms to create starting solutions for improvement algo…
The obnoxious facilities planar p-median problem
Pawel Kalczynski, Zvi Drezner
In this paper we propose the planar obnoxious p-median problem. In the p-median problem the objective is to find p locations for facilities that minimize the weighted sum of distan…
Directional approach to gradual cover: the continuous case
Tammy Drezner, Zvi Drezner, Pawel Kalczynski
The objective of the cover location models is covering demand by facilities within a given distance. The gradual (or partial) cover replaces abrupt drop from full cover to no cover…
Partitioning Items Into Mutually Exclusive Groups
Pawel Kalczynski, Zvi Goldstein, Zvi Drezner
We investigate a new model for partitioning a set of items into groups (clusters). The number of groups is given and the distances between items are well defined. These distances m…