Computational aspects of the maximum diversity problem
type: Item
instance of: scholarly article
title: Computational aspects of the maximum diversity problem
zbMATH Open document ID: 0873.90070
DOI: 10.1016/0167-6377(96)00025-9
author: Jay B. Ghosh
published in: Operations Research Letters
publication date: 1997-07-15T00:00:00Z
full work available at URL: http://hdl.handle.net/11693/10887
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 1034129
zbMATH Keywords: maximum diversity problem
zbMATH Keywords: randomized greedy heuristics
MaRDI profile type: Publication
OpenAlex ID: W2164719474
cites work: Lexicographic bottleneck problems
cites work: A GRASP for a difficult single machine scheduling problem
cites work: Greedy randomized adaptive search procedures
cites work: Q4198056
cites work: Semi-greedy heuristics: An empirical study
cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming
cites work: Q4303939
cites work: Q3998294
description: scientific article; zbMATH DE number 1034129