New local searches for solving the multi-source Weber problem
From MaRDI portal
Publication:512988
DOI10.1007/S10479-015-1797-5zbMATH Open1357.90165OpenAlexW2051632436MaRDI QIDQ512988FDOQ512988
Authors: Jack Brimberg, Nenad Mladenović, Zvi Drezner, Said Salhi 
Publication date: 3 March 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1797-5
Recommendations
decompositioncontinuous \(p\)-medianWeiszfeld algorithmconstructive heuristiclimited distance medianlocate-allocate
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- An optimal method for solving the (generalized) multi-Weber problem
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- A projection method for \(l_ p\) norm location-allocation problems
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Location-Allocation Problems
- Heuristic Methods for Location-Allocation Problems
- Decomposition strategies for large-scale continuous location–allocation problems
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Exact and approximate solutions to the multisource weber problem
- Title not available (Why is that?)
- On the Complexity of Some Common Geometric Location Problems
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- GBSSS: The generalized big square small square method for planar single- facility location
- Big segment small segment global optimization algorithm on networks
- IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
- A new heuristic for solving the \(p\)-median problem in the plane
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- Two algorithms for constructing a Delaunay triangulation
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- Location Theory, Dominance, and Convexity
- The big cube small cube solution method for multidimensional facility location problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- Variable neighborhood search for the p-median
- A new local search for continuous location problems
- Solution of the multisource Weber and conditional Weber problems by d. -c. programming
- Generating good starting solutions for the \(p\)-median problem in the plane
- Sum-of-squares clustering on networks
- Title not available (Why is that?)
- An Efficient Method for the Multi-Depot Location-Allocation Problem
- The Facility Location Problem with Limited Distances
- Subdrop: A modified drop heuristic for location problems
- Improving worst-case behavior of heaps
- Primal-dual variable neighborhood search for the simple plant-location problem
- Algorithms and Data Structures
- Geometric clusterings
- Title not available (Why is that?)
- Heuristic cluster algorithm for multiple facility location-allocation problem
Cited In (20)
- A dry port hub-and-spoke network design: an optimization model, solution method, and application
- Multi-facility green Weber problem
- Extensions to the planar \(p\)-median problem
- Solving a minisum single facility location problem in three regions with different norms
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- A Neural Heuristic For The Multisource Weber Problem
- A hyperbolic smoothing approach to the multisource Weber problem
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- New heuristic algorithms for solving the planar \(p\)-median problem
- Biologically inspired parent selection in genetic algorithms
- A cellular heuristic for the multisource Weber problem.
- Solving multiple facilities location problems with separated clusters
- Using injection points in reformulation local search for solving continuous location problems
- Improved starting solutions for the planar \(p\)-median problem
- A voltage drop limited decentralized electric power distribution network
- A trajectory based heuristic for the planar \(p\)-median problem
- A new local search for continuous location problems
- The planar multifacility collection depots location problem
Uses Software
This page was built for publication: New local searches for solving the multi-source Weber problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512988)
