Show simple item record

dc.contributor.authorGhosh, J. B.en_US
dc.date.accessioned2015-07-28T11:56:11Z
dc.date.available2015-07-28T11:56:11Z
dc.date.issued1996en_US
dc.identifier.issn0167-6377
dc.identifier.urihttp://hdl.handle.net/11693/10887
dc.description.abstractWe 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.language.isoEnglishen_US
dc.source.titleOperations Research Lettersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/0167-6377(96)00025-9en_US
dc.subjectMaximum diversityen_US
dc.subjectComputational complexityen_US
dc.subjectHeuristicsen_US
dc.titleComputational aspects of the maximum diversity problemen_US
dc.typeArticleen_US
dc.departmentDepartment of Managementen_US
dc.citation.spage175en_US
dc.citation.epage181en_US
dc.citation.volumeNumber19en_US
dc.citation.issueNumber4en_US
dc.identifier.doi10.1016/0167-6377(96)00025-9en_US
dc.publisherElsevieren_US
dc.identifier.eissn1872-7468


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record