New heuristic algorithms for solving the planar \(p\)-median problem (Q337669): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.cor.2014.05.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054920135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient genetic algorithm for the \(p\)-median problem / 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: A new heuristic for solving the \(p\)-median problem in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating good starting solutions for the p-median problem in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new local search for continuous location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition strategies for large-scale continuous location–allocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3598873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degeneracy in the multi-source Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving worst-case behavior of heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian variable neighborhood search for continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gender-Specific Genetic Algorithms<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Genetic Algorithm for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distance based rule for removing population members in genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New local searches for solving the multi-source Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Facility Location Problem with Limited Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using hybrid metaheuristics for the one-way and two-way network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anisogamy, Expenditure of Reproductive Effort, and the Optimality of Having Two Sexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / 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: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: General variable neighborhood search for the continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Method for the Multi-Depot Location-Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: GBSSS: The generalized big square small square method for planar single- facility location / 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 genetic algorithm based approach for the uncapacitated continuous location-allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The big cube small cube solution method for multidimensional facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods for large centroid clustering problems / rank
 
Normal rank

Latest revision as of 21:56, 12 July 2024

scientific article
Language Label Description Also known as
English
New heuristic algorithms for solving the planar \(p\)-median problem
scientific article

    Statements

    New heuristic algorithms for solving the planar \(p\)-median problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    location analysis
    0 references
    planar \(p\)-median
    0 references
    multi-source Weber problem
    0 references
    variable neighborhood search
    0 references
    genetic algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers