An optimal method for solving the (generalized) multi-Weber problem
From MaRDI portal
Publication:1197648
DOI10.1016/0377-2217(92)90072-HzbMath0760.90064MaRDI QIDQ1197648
Publication date: 16 January 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
90B80: Discrete location and assignment
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
An agent-based framework for modeling and solving location problems, Facility location models for distribution system design, A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand, The multi-facility location-allocation problem with polyhedral barriers, Multi-source facility location-allocation and inventory problem, Allocation search methods for a generalized class of location-allocation problems, Solving probabilistic multi-facility Weber problem by vector quantization, An optimal method for solving the (generalized) multi-Weber problem, Heuristic solution of the multisource Weber problem as a \(p\)-median problem, Weber problems with alternative transportation systems, Kohonen maps for solving a class of location-allocation problems, Stabilized column generation, 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, A cellular heuristic for the multisource Weber problem., Location analysis: a synthesis and survey, A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
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