A two-phase tabu search based evolutionary algorithm for the maximum diversity problem (Q2673240): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ming-hui Wang / rank
Normal rank
 
Property / author
 
Property / author: Ming-hui Wang / rank
 
Normal rank
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.1016/j.disopt.2020.100613 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3093839249 / 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: Heuristic and Special Case Algorithms for Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of tabu search heuristic for the maximum edge-weighted subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equitable dispersion 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: Q3070929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum diversity problem / 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: Tabu search and GRASP for the maximum diversity 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: Variable neighborhood search for the heaviest \(k\)-subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memetic self-adaptive evolution strategies applied to the maximum diversity 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: Iterated greedy for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid metaheuristic method for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid metaheuristic approach to solving the UBQP problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4245749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition-distance: A problem and class of perfect graphs arising in clustering / rank
 
Normal rank

Latest revision as of 07:13, 29 July 2024

scientific article
Language Label Description Also known as
English
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
scientific article

    Statements

    A two-phase tabu search based evolutionary algorithm for the maximum diversity problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum diversity problem
    0 references
    hybrid evolutionary algorithm
    0 references
    tabu search
    0 references
    dynamic candidate list
    0 references
    path relinking
    0 references
    recombination operator
    0 references
    0 references