Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 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: J-MEANS / 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/net.10081 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094078700 / 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 new adaptive multi-start technique for combinatorial global optimizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The p-Centre Problem-Heuristic and Optimal Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple heuristic for the p-centre problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the p-median / rank
 
Normal rank
Property / cites work
 
Property / cites work: J-MEANS: A new local search heuristic for minimum sum of squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3474476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>m</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the p-center problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:06, 6 June 2024

scientific article; zbMATH DE number 1968017
Language Label Description Also known as
English
Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search
scientific article; zbMATH DE number 1968017

    Statements

    Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 August 2003
    0 references
    location
    0 references
    \(p\)-center
    0 references
    heuristics
    0 references
    tabu search
    0 references
    variable neighborhood search
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references