A heuristic approach for the max-min diversity problem based on max-clique (Q1010298): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Tabu search versus GRASP for the maximum diversity problem / 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: Heuristic algorithms for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location on Tree Networks: <i>P</i>-Centre and <i>n</i>-Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete p-dispersion 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: Q4037432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian solution of maximum dispersion problems / 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: GRASP and path relinking for the max-min diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure and conquer / 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: A fast algorithm for the maximum clique problem / rank
 
Normal rank

Revision as of 10:30, 1 July 2024

scientific article
Language Label Description Also known as
English
A heuristic approach for the max-min diversity problem based on max-clique
scientific article

    Statements

    A heuristic approach for the max-min diversity problem based on max-clique (English)
    0 references
    0 references
    0 references
    0 references
    3 April 2009
    0 references
    max-min diversity
    0 references
    \(m\)-dispersion
    0 references
    \(m\)-facility dispersion
    0 references
    max-clique
    0 references

    Identifiers