Tabu search and GRASP for the maximum diversity problem (Q857362): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory / 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: A discrete optimization model for preserving biological diversity / 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: Scatter search. Methodology and implementation in C. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensification and diversification with elite tabu search solutions for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452897 / rank
 
Normal rank

Latest revision as of 11:42, 25 June 2024

scientific article
Language Label Description Also known as
English
Tabu search and GRASP for the maximum diversity problem
scientific article

    Statements

    Tabu search and GRASP for the maximum diversity problem (English)
    0 references
    0 references
    0 references
    14 December 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    global optimization
    0 references
    metaheuristics
    0 references
    tabu search
    0 references
    0 references