Exact and approximate solutions to the multisource weber problem

Cites Work

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

Cited In (38)

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

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)