New local searches for solving the multi-source Weber problem
From MaRDI portal
(Redirected from Publication:512988)
Recommendations
Cites work
- scientific article; zbMATH DE number 5501651 (Why is no real title available?)
- scientific article; zbMATH DE number 2114494 (Why is no real title available?)
- scientific article; zbMATH DE number 3074559 (Why is no real title available?)
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- A new heuristic for solving the \(p\)-median problem in the plane
- A new local search for continuous location problems
- A projection method for \(l_ p\) norm location-allocation problems
- Algorithms and Data Structures
- An Efficient Method for the Multi-Depot Location-Allocation Problem
- An optimal method for solving the (generalized) multi-Weber problem
- Big segment small segment global optimization algorithm on networks
- Decomposition strategies for large-scale continuous location–allocation problems
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Exact and approximate solutions to the multisource weber problem
- GBSSS: The generalized big square small square method for planar single- facility location
- Generating good starting solutions for the \(p\)-median problem in the plane
- Geometric clusterings
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Heuristic Methods for Location-Allocation Problems
- Heuristic cluster algorithm for multiple facility location-allocation problem
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
- Improving worst-case behavior of heaps
- Location Theory, Dominance, and Convexity
- Location-Allocation Problems
- On the Complexity of Some Common Geometric Location Problems
- Primal-dual variable neighborhood search for the simple plant-location problem
- Solution of the multisource Weber and conditional Weber problems by d. -c. programming
- Subdrop: A modified drop heuristic for location problems
- Sum-of-squares clustering on networks
- TSPLIB—A Traveling Salesman Problem Library
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Facility Location Problem with Limited Distances
- The big cube small cube solution method for multidimensional facility location problems
- Two algorithms for constructing a Delaunay triangulation
- Variable neighborhood search for the p-median
Cited in
(20)- The planar multifacility collection depots location problem
- 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 hyperbolic smoothing approach to the multisource Weber problem
- A Neural Heuristic For The Multisource Weber Problem
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
- 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
- A voltage drop limited decentralized electric power distribution network
- Improved starting solutions for the planar \(p\)-median problem
- A trajectory based heuristic for the planar \(p\)-median problem
- A new local search for continuous location problems
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)
