A hybrid data mining metaheuristic for the <i>p</i>‐median problem (Q4969775): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / 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.1002/sam.10116 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2122247816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the DM‐GRASP heuristic: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP – Part I: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP-Part II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data mining. Concepts and techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5312442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybridization of GRASP metaheuristic with data mining techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary heuristic for quadratic 0-1 programming / 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: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-median problem: a survey of metaheuristic approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on solving large p-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection method for \(l_ p\) norm location-allocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cellular heuristic for the multisource Weber problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: TTT plots: a perl program to create time-to-target plots / rank
 
Normal rank

Latest revision as of 19:26, 23 July 2024

scientific article; zbMATH DE number 7260285
Language Label Description Also known as
English
A hybrid data mining metaheuristic for the <i>p</i>‐median problem
scientific article; zbMATH DE number 7260285

    Statements

    A hybrid data mining metaheuristic for the <i>p</i>‐median problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 October 2020
    0 references
    hybrid metaheuristics
    0 references
    GRASP
    0 references
    data mining
    0 references
    p-median problem
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references