Construction and improvement algorithms for dispersion problems (Q726217): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Maximum diversity/similarity models with extension to part grouping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composing medical crews with equity and efficiency / 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: Variable neighborhood search for the heaviest \(k\)-subgraph / 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: Analytical models for locating undesirable facilities / 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: Hybrid heuristics for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / 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: Simple ingredients leading to very efficient heuristics for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search / 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: GRASP and path relinking for the equitable dispersion 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: Upper bounds and exact algorithms for \(p\)-dispersion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective algorithm for the MaxMin diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equitable dispersion 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: An empirical comparison of heuristic methods for creating maximally diverse groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid metaheuristic method for the maximum diversity problem / rank
 
Normal rank

Revision as of 06:40, 12 July 2024

scientific article
Language Label Description Also known as
English
Construction and improvement algorithms for dispersion problems
scientific article

    Statements

    Construction and improvement algorithms for dispersion problems (English)
    0 references
    0 references
    0 references
    0 references
    8 July 2016
    0 references
    combinatorial optimization
    0 references
    dispersion problems
    0 references
    binary quadratic programming
    0 references
    tabu search
    0 references
    0 references
    0 references

    Identifiers