An optimal method for solving the (generalized) multi-Weber problem
From MaRDI portal
Publication:1197648
DOI10.1016/0377-2217(92)90072-HzbMath0760.90064OpenAlexW1991912455MaRDI QIDQ1197648
Publication date: 16 January 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90072-h
Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (30)
A projection method for \(l_ p\) norm location-allocation problems ⋮ On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre ⋮ An agent-based framework for modeling and solving location problems ⋮ The optimal solution set of the multi-source Weber problem ⋮ A two-echelon joint continuous-discrete location model ⋮ Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem ⋮ Conflict-tolerant and conflict-free multi-agent meeting ⋮ A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification ⋮ A cellular heuristic for the multisource Weber problem. ⋮ Unnamed Item ⋮ \(k\)-means genetic algorithms with greedy genetic operators ⋮ A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach ⋮ New local searches for solving the multi-source Weber problem ⋮ An optimal method for solving the (generalized) multi-Weber problem ⋮ The multi-facility location-allocation problem with polyhedral barriers ⋮ A new local search for continuous location problems ⋮ Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm ⋮ Facility location models for distribution system design ⋮ A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand ⋮ Location analysis: a synthesis and survey ⋮ Multi-source facility location-allocation and inventory problem ⋮ Allocation search methods for a generalized class of location-allocation problems ⋮ Heuristic solution of the multisource Weber problem as a \(p\)-median problem ⋮ Solving probabilistic multi-facility Weber problem by vector quantization ⋮ Weber problems with alternative transportation systems ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms ⋮ Kohonen maps for solving a class of location-allocation problems ⋮ Stabilized column generation ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem ⋮ An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Localization in single facility location
- Hull properties in location problems
- An optimal method for solving the (generalized) multi-Weber problem
- Sulla determinazione del centro di gravita e del centro mediano di una popolazione, con applicazioni alla popolazione italiana censita il \(1^\circ\) dicembre 1921
- On Grouping for Maximum Homogeneity
- The Euclidean Multifacility Location Problem
- Location-Allocation Problems
- The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Heuristic Methods for Location-Allocation Problems
- Link-Length Minimization in Networks
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Computer Solutions to Minimum-Cover Problems
- The Location of Emergency Service Facilities
- Exact and approximate solutions to the multisource weber problem
- Location Theory, Dominance, and Convexity
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: An optimal method for solving the (generalized) multi-Weber problem
