Exact and approximate solutions to the multisource weber problem

Cites work

An Application of Dynamic Programming to Location—Allocation Problems
Branch-and-Bound Methods: A Survey
Branch-and-Bound Methods: General Formulation and Properties
Heuristic Methods for Location-Allocation Problems
Location-Allocation Problems
Seven Kinds of Convexity
The Depot Siting Problem with Discontinuous Delivery Cost^†

Cited in

(42)

Allocation search methods for a generalized class of location-allocation problems
The impact of distance on location problems
Locational analysis
An optimal method for solving the (generalized) multi-Weber problem
Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
Determining dominant wind directions
Heuristic solution of the multisource Weber problem as a \(p\)-median problem
Kohonen maps for solving a class of location-allocation problems
A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
A projection method for \(l_ p\) norm location-allocation problems
A cellular heuristic for the multisource Weber problem.
Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
The planar multifacility collection depots location problem
A two-echelon joint continuous-discrete location model
Genetic algorithm for obstacle location-allocation problems with customer priorities
\(k\)-means genetic algorithms with greedy genetic operators
The obnoxious facilities planar \(p\)-median problem
A new local search for continuous location problems
Solving multiple facilities location problems with separated clusters
Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem
Fuzzy facility location-allocation problem under the Hurwicz criterion
An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
The capacitated facility location-allocation problem under uncertain environment
Improved starting solutions for the planar p-median problem
LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
On the Fermat—Weber problem with convex cost functions
New local searches for solving the multi-source Weber problem
The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
Asymmetric distance location model
On solving unreliable planar location problems
Variable neighborhood search: Principles and applications
An efficient heuristic for the \(k\)-partitioning problem
A trajectory based heuristic for the planar \(p\)-median problem
An agent-based framework for modeling and solving location problems
A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification
Extensions to the planar \(p\)-median problem
Local solutions of the multi-source Weber problem
An improved algorithm for solving the Weber location problem
On the probability that the optimal solution of the Weber location problem is at a demand point
The Weber problem with demand uniformly generated in discs
Attraction probabilities in variable neighborhood search

This page was built for publication: Exact and approximate solutions to the multisource weber problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5657909)