MINIMAX LOCATION OF A FACILITY IN AN UNDIRECTED TREE GRAPH.

Research output: Contribution to journalArticlepeer-review

Abstract

The paper is addressed to the problem of locating the absolute and vertex centers (minimax criterion) of an undirected tree graph. Based upon a convexity property of the criterion function a very simple and efficient algorithm is offered that locates the minimax point by locating first a maximax point. The minimax is at the mid-point of the maximum path from the maximax point. The vertex center is located simultaneously.

Original languageEnglish
Pages (from-to)287-293
Number of pages7
JournalTransportation Science
Volume7
Issue number3
DOIs
StatePublished - 1973

Fingerprint

Dive into the research topics of 'MINIMAX LOCATION OF A FACILITY IN AN UNDIRECTED TREE GRAPH.'. Together they form a unique fingerprint.

Cite this