Computational aspects of the maximum diversity problem

dc.citation.epage	181	en_US
dc.citation.issueNumber	4	en_US
dc.citation.spage	175	en_US
dc.citation.volumeNumber	19	en_US
dc.contributor.author	Ghosh, J. B.	en_US
dc.date.accessioned	2015-07-28T11:56:11Z
dc.date.available	2015-07-28T11:56:11Z
dc.date.issued	1996	en_US
dc.department	Department of Management	en_US
dc.description.abstract	We address two variations of the maximum diversity problem which arises when m elements are to be selected from an n-element population based on inter-element distances. We study problem complexity and propose randomized greedy heuristics. Performance of the heuristics is tested on a limited basis.	en_US
dc.identifier.doi	10.1016/0167-6377(96)00025-9	en_US
dc.identifier.eissn	1872-7468
dc.identifier.issn	0167-6377
dc.identifier.uri	http://hdl.handle.net/11693/10887
dc.language.iso	English	en_US
dc.publisher	Elsevier	en_US
dc.relation.isversionof	http://dx.doi.org/10.1016/0167-6377(96)00025-9	en_US
dc.source.title	Operations Research Letters	en_US
dc.subject	Maximum diversity	en_US
dc.subject	Computational complexity	en_US
dc.subject	Heuristics	en_US
dc.title	Computational aspects of the maximum diversity problem	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1