Exact and approximate solutions to the multisource weber problem

DOI10.1007/BF01584989MaRDI QIDQ5657909zbMATH OpenOpenAlexFDO

Authors Robert E. Kuenne, Richard M. Soland

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)

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

(38)

• The planar multifacility collection depots location problem
• Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
• 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
• On the Fermat—Weber problem with convex cost functions
• Asymmetric distance location model
• Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
• On solving unreliable planar location problems
• Allocation search methods for a generalized class of location-allocation problems
• Attraction probabilities in variable neighborhood search
• Extensions to the planar \(p\)-median problem
• An optimal method for solving the (generalized) multi-Weber problem
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• Variable neighborhood search: Principles and applications
• Kohonen maps for solving a class of location-allocation problems
• The obnoxious facilities planar \(p\)-median problem
• A projection method for \(l_ p\) norm location-allocation problems
• Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
• The capacitated facility location-allocation problem under uncertain environment
• An efficient heuristic for the \(k\)-partitioning problem
• Determining dominant wind directions
• Genetic algorithm for obstacle location-allocation problems with customer priorities
• The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
• New local searches for solving the multi-source Weber problem
• Locational analysis
• The impact of distance on location problems
• A two-echelon joint continuous-discrete location model
• 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
• Improved starting solutions for the planar \(p\)-median problem
• 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

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)