My library button

No image available

Heuristic and Special Case Algorithms for Dispersion Problems

by S. S. Ravi, D. J. Rosenkrantz, G. K. Tayi ยท 1991

ISBN:  Unavailable

Category: Unavailable

Page count: 27

Abstract: "Several situations involving facility location or multi-objective decision making can be modeled as a suitably posed dispersion problem. Typically, this dispersion problem involves selecting facilities (or selecting non-dominated solutions) so as to maximize some function of the distances between facilities (or dissimilarity between selected solutions). We consider the problem under two different optimality criteria, namely maximizing the minimum distance (MAX-MIN) between any pair of facilities and maximizing the average distance (MAX- AVG) between any pair of facilities. Under either criterion, the problem is known to be NP-hard, even when the distances satisfy the triangle inequality