Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792): 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: Solving the maximum min-sum dispersion by alternating formulations of two different problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knapsack Sharing 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: Computational aspects of 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: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: basics and variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the capacitated dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equitable dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility dispersion problems under capacity and cost constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective metaheuristic algorithms for the minimum differential dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical comparison of heuristic methods for creating maximally diverse groups / rank
 
Normal rank

Latest revision as of 05:45, 28 July 2024

scientific article
Language Label Description Also known as
English
Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
scientific article

    Statements

    Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2022
    0 references
    heuristics
    0 references
    variable neighborhood search
    0 references
    capacitated dispersion problem
    0 references
    combinatorial optimization
    0 references

    Identifiers