An O(n) algorithm for the linear multiple choice knapsack problem and related problems
Information Processing Letters
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
An algorithm for the Lorenz measure in locational decisions on trees
Journal of Algorithms
A note on locating a central vertex of a 3-cactus graph
Computers and Operations Research
Off-line maintenance of planar configurations
Journal of Algorithms
A generalized model of equality measures in network location problems
Computers and Operations Research
A comparison of formulations and solution methods for the minimum-envy location problem
Computers and Operations Research
Extensive facility location problems on networks with equity measures
Discrete Applied Mathematics
Equitable service by a facility: Minimizing the Gini coefficient
Computers and Operations Research
The multi-facility median problem with Pos/Neg weights on general graphs
Computers and Operations Research
An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width
Operations Research Letters
Range minimization problems in path-facility location on trees
Discrete Applied Mathematics
Hi-index | 0.04 |
We consider single facility location problems with equity measures, defined on networks. The models discussed are, the variance, the sum of weighted absolute deviations, the maximum weighted absolute deviation, the sum of absolute weighted differences, the range, and the Lorenz measure. We review the known algorithmic results and present improved algorithms for some of these models.