New local searches for solving the multi-source Weber problem (Q512988): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Zvi Drezner / rank
Normal rank
 
Property / author
 
Property / author: Said Salhi / rank
Normal rank
 
Property / author
 
Property / author: Said Salhi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / 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.1007/s10479-015-1797-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051632436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Big segment small segment global optimization algorithm on networks / 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: Generating good starting solutions for the p-median problem in the plane / 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: A new heuristic for solving 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: Improving worst-case behavior of heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-of-squares clustering on networks / 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: The Facility Location Problem with Limited Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / 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: Heuristic solution of the multisource Weber problem as a \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5813619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate solutions to the multisource weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for constructing a Delaunay triangulation / 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: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic cluster algorithm for multiple facility location-allocation problem / 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: IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS / 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: An optimal method for solving the (generalized) multi-Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdrop: A modified drop heuristic for location problems / 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: A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location Theory, Dominance, and Convexity / 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

Latest revision as of 12:55, 13 July 2024

scientific article
Language Label Description Also known as
English
New local searches for solving the multi-source Weber problem
scientific article

    Statements

    New local searches for solving the multi-source Weber problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 March 2017
    0 references
    constructive heuristic
    0 references
    decomposition
    0 references
    limited distance median
    0 references
    locate-allocate
    0 references
    continuous \(p\)-median
    0 references
    Weiszfeld algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers