The Asymmetric Distance Location Problem Academic Article uri icon

  •  
  • Overview
  •  
  • Research
  •  
  • Identity
  •  
  • Additional Document Info
  •  
  • View All
  •  

abstract

  • In many situations the distance between two points is not a symmetric function; i.e., the distance from A to B is different from the distance from B to A. This is typical, for example, in rush hour traffic. We consider four models: the minisum or minimax problems with rectilinear or Euclidean distances. Efficient algorithms for the solution of these four problems are presented.

publication date

  • August 1989