The Maximin-Maxisum Network Location Problem

Authors:
Frank Guangsheng Zhang;Emanuel Melachrinoudis
Affiliations:
Clearing and Settlement Systems, Instinet Corporation, 850 Third Avenue, New York, NY, 10022, USA. zhang@ms.com;Department of Mechanical, Industrial, and Manufacturing Engineering, Northeastern University, Boston, Massachusetts 02115, USA. emelas@neu.edu
Venue:
Computational Optimization and Applications
Year:
2001

Citing 4
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
A multiobjective model for locating undesirable facilities

Annals of Operations Research - Special issue on locational decisions
An O(mn) algorithm for the 1-maximin problem on a network

Computers and Operations Research
Algorithm 97: Shortest path

Communications of the ACM

Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of finding a point on a general network using two objectives, maximizing the minimum weighted distance from the point to the vertices (Maximin) and maximizing the sum of weighted distances between the point and the vertices (Maxisum). This bicriterion model can be used to locate an obnoxious facility on a network. We will identify the model properties, develop a polynomial algorithm for generating the efficient set and provide a numerical example.