A hybrid metaheuristic method for the maximum diversity problem (Q2356110): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solving the maximum edge weight clique problem via unconstrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070929 / 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: Obtaining test problems via Internet / 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: Approximation Algorithms for Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / 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: Comparison Of Four Models For dispersing Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for member selection of cross-functional teams using the individual and collaborative performances / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient memetic algorithm for the graph partitioning 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: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) / 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: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black box scatter search for general classes of binary optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum dispersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in memetic algorithms. / 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: Iterated greedy 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: An application of tabu search heuristic for the maximum edge-weighted subgraph problem / 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: A branch and bound algorithm 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: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equitable dispersion 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: Memetic search for the max-bisection problem / rank
 
Normal rank

Latest revision as of 14:35, 10 July 2024

scientific article
Language Label Description Also known as
English
A hybrid metaheuristic method for the maximum diversity problem
scientific article

    Statements

    A hybrid metaheuristic method for the maximum diversity problem (English)
    0 references
    0 references
    0 references
    28 July 2015
    0 references
    maximum diversity problem
    0 references
    solution combination
    0 references
    local search
    0 references
    constrained neighborhood
    0 references
    population diversity
    0 references
    0 references
    0 references
    0 references

    Identifiers