logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

An O(mn) algorithm for the 1-maximin problem on a network

delete1999-08-01
delete12
PRE
AI
E
Emanuel Melachrinoudis *
F
Frank Guangsheng Zhang
DOI：10.1016/S0305-0548(98)00099-9delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This paper addresses the problem of locating a point on a general network with n vertices and m edges, so as to maximize the minimum weighted distance from the point to the vertices (l-maximin). Based on several properties, it is shown that there exists a unique local l-maximin point on each edge and therefore at least one but no more than m l-maximin points on the network. An efficient O(mn) algorithm for finding the optimal set is developed and implemented on a PC. Computational results and a numerical example are provided. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keywords:
network location
undesirable facilities
maximin problem
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

No organization information available