Heuristic and Special Case Algorithms for Dispersion Problems

The dispersion problem arises in selecting facilities to maximize some function of the distances between the facilities. The problem also arises in selecting nondominated solutions for multiobjective decision making. It is known to be NP-hard under two objectives: maximizing the minimum distance ( M...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Operations research Jg. 42; H. 2; S. 299 - 310
Hauptverfasser:	Ravi, S. S, Rosenkrantz, D. J, Tayi, G. K
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Linthicum, MD INFORMS 01.03.1994 Operations Research Society of America Institute for Operations Research and the Management Sciences
Schlagworte:	Algorithms analysis of algorithms: computational complexity Applied sciences Approximation algorithms Dynamic programming Exact sciences and technology facilities/equipment planning: discrete location Flows in networks. Combinatorial problems Functions Heuristic Heuristics Inequality Integers Mathematical theorems Natural satellites Operational research and scientific management Operational research. Management science Operations research Optimal solutions Optimization Polynomials programming: heuristic Studies Triangle inequalities One dimensional model Heuristic method Two dimensional model Facility Algorithm Computational complexity Location problem Dispersion
ISSN:	0030-364X, 1526-5463
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!