Exact and approximate solutions to the multisource weber problem

DOI10.1007/BF01584989zbMath0245.90021OpenAlexW2003529684MaRDI QIDQ5657909

Richard M. Soland, Robert E. Kuenne

Publication date: 1972

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584989

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (38)

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

Cites Work

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

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