A simple and effective algorithm for the MaxMin diversity problem (Q646655): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-011-0898-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032156155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search versus GRASP for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach for the max-min diversity problem based on max-clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search and GRASP for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete p-dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid heuristics for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple ingredients leading to very efficient heuristics for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good solutions to discrete noxious location problems via metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated tabu search for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and path relinking for the max-min diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the DM‐GRASP heuristic: a survey / rank
 
Normal rank

Latest revision as of 16:29, 4 July 2024

scientific article
Language Label Description Also known as
English
A simple and effective algorithm for the MaxMin diversity problem
scientific article

    Statements

    A simple and effective algorithm for the MaxMin diversity problem (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2011
    0 references
    maximum diversity
    0 references
    MaxMin diversity
    0 references
    tabu search
    0 references

    Identifiers